IACR logo

TCC 2007

February 21-24 2007, Trippenhuis
Amsterdam, The Netherlands

TCC 2007 Accepted Papers
(in order of submission)
Parallel Repetition of Computationally Sound Protocols Revisited
Krzysztof Pietrzak and Douglas Wikström

Designated Confirmer Signatures Revisited
Douglas Wikström

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Yonatan Aumann and Yehuda Lindell

From Weak to Strong Watermarking
Nicholas Hopper and David Molnar and David Wagner

How To Shuffle in Public
Ben Adida and Douglas Wikström

On Expected Probabilistic Polynomial-Time Adversaries -- A suggestion for restricted definitions and their benefits
Oded Goldreich

Weakly-Private Secret Sharing Schemes
Amos Beimel and Matthew Franklin

On Secret Sharing Schemes, Matroids and Polymatroids
Jaume Marti-Farre and Carles Padro

Long-term Security and Universal Composability
Jörn Müller-Quade and Dominique Unruh

One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
Hoeteck Wee

Lower Bounds for Non-Interactive Zero-Knowledge
Hoeteck Wee

Towards a Separation of Semantic and CCA Security for Public Key Encryption
Yael Gertner and Tal Malkin and Steven Myers

Conjunctive, Subset, and Range Queries on Encrypted Data
Dan Boneh and Brent Waters

Universally Composable Security with Global Setup
Ran Canetti and Yevgeniy Dodis and Rafael Pass and Shabsi Walfish

Obfuscation for Cryptographic Purposes
Dennis Hofheinz and John Malone-Lee and Martijn Stam

Unifying Classical and Quantum Key Distillation
Matthias Christandl and Artur Ekert and Michal Horodecki and Pawel Horodecki and Jonathan Oppenheim and Renato Renner

Perfect NIZK with Adaptive Soundness
Masayuki Abe and Serge Fehr

Does Privacy Require True Randomness?
Carl Bosley and Yevgeniy Dodis

On the Necessity of Rewinding in Secure Multiparty Computation
Michael Backes and Jörn Müller-Quade and Dominique Unruh

Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions
Carmit Hazay and Jonathan Katz and Chiu-Yuen Koo and Yehuda Lindell

Towards Optimal and Efficient Perfectly Secure Message Transmission
Matthias Fitzi and Matthew Franklin and Juan Garay and S. Harsha Vardhan

Evaluating Branching Programs on Encrypted Data
Yuval Ishai and Anat Paskin

Secure Linear Algebra Using Linearly Recurrent Sequences
Eike Kiltz and Payman Mohassel and Enav Weinreb and Matthew Franklin

Robuster Combiners for Oblivious Transfer
Remo Meier and Bartosz Przydatek and Juerg Wullschleger

Private Approximation of Clustering and Vertex Cover
Amos Beimel and Renen Hallak and Kobbi Nissim

(Password) Authenticated Key Establishment: From 2-Party To Group
Michel Abdalla and Jens-Matthias Bohli and Maria Isabel Gonzalez Vasco and Rainer Steinwandt

Intrusion-Resilient Authenticated Key Exchange in the Bounded Retrieval Model without Random Oracles
David Cash and Yan Zong Ding and Yevgeniy Dodis and Wenke Lee and Richard Lipton and Shabsi Walfish

Adaptively Secure Multicast Encryption
Saurabh Panjwani

Securely Obfuscating Re-Encryption
Susan Hohenberger and Guy N. Rothblum and abhi shelat and Vinod Vaikuntanathan

On Best-Possible Obfuscation
Shafi Goldwasser and Guy Rothblum

Multi-Authority Attribute-Based Encryption
Melissa Chase