Seventh IACR Theory of Cryptography Conference

TCC 2010

February 9-11, 2010, ETH Zurich
Zurich, Switzerland

Accepted Papers

A Domain Extender for the Ideal Cipher
Jean-Sebastien Coron and Yevgeniy Dodis and Avradip Mandal and Yannick Seurin
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
Ueli Maurer and Stefano Tessaro
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
Ronald Cramer and Dennis Hofheinz and Eike Kiltz
Almost Optimal Bounds for Direct Product Threshold Theorem
Charanjit S Jutla
An Efficient Parallel Repetition Theorem
Johan Hastad and Rafael Pass and Douglas Wikstrom and Krzysztof Pietrzak
Bounds on the Sample Complexity for Private Learning and Private Data Release
Amos Beimel and Shiva Kasiviswanathan and Kobbi Nissim
Composition of Zero-Knowledge Proofs with Efficient Provers
Eleanor Birrell and Salil Vadhan
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Benoit Libert and Moti Yung
Delayed-Key Message Authentication for Streams
Marc Fischlin and Anja Lehmann
Efficiency Limitations for $\Sigma$-Protocols for Group Homomorphisms
Endre Bangerter and Jan Camenisch and Stephan Krenn
Efficiency Preserving Transformations for Concurrent Non-Malleable Zero-Knowledge
Rafail Ostrovsky and Omkant Pandey and Ivan Visconti
Efficient Rational Secret Sharing in Standard Communication Networks
Georg Fuchsbauer and Jonathan Katz and David Naccache
Efficient, Robust and Constant-Round Distributed RSA Key Generation
Ivan Damg�rd and Gert L�ss�e Mikkelsen
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
Rafael Pass and Wei-Lung Dustin Tseng and Muthuramakrishnan Venkitasubramaniam
Founding Cryptography on Tamper-Proof Hardware Tokens
Vipul Goyal and Yuval Ishai and Amit Sahai and Ramarathnam Venkatesan and Akshay Wadia
From Passive to Covert Security at Low Cost
Ivan Damg�rd and Martin Geisler and Jesper Buus Nielsen
Fully Secure HIBE with Short Ciphertext
Allison B. Lewko and Brent Waters
Ideal Hierarchical Secret Sharing Schemes
Oriol Farr�s and Carles Padr�
Leakage-Resilient Signatures
Sebastian Faust and Eike Kiltz and Krzysztof Pietrzak and Guy Rothblum
Obfuscation of Hyperplanes
Ran Canetti and Guy Rothblum and Mayank Varia
On Building Fairness Bit by Bit
S. Dov Gordon and Yuval Ishai and Tal Moran and Rafail Ostrovsky and Amit Sahai
On Related-Secret Pseudorandomness
David Goldenberg and Moses Liskov
On Symmetric Encryption and Point Obfuscation
Ran Canetti and Yael Tauman Kalai and Mayank Varia and Daniel Wichs
On the Necessary and Sufficient Assumptions for UC Computation
Ivan Damg�rd and Jesper Buus Nielsen and Claudio Orlandi
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
Rafael Pass and Muthuramakrishnan Venkitasubramaniam
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Vadim Lyubashevsky and Adriana Palacio and Gil Segev
Public-key Encryption Schemes with Auxiliary Inputs
Yevgeniy Dodis and Shafi Goldwasser and Yael Kalai and Chris Peikert and Vinod Vaikuntanathan
Rationality in the Full-Information Model
Ronen Gradwohl
Robust Encryption
Michel Abdalla and Mihir Bellare and Gregory Neven
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Rikke Bendlin and Ivan Damg�rd
Tight Parallel Repetition Theorems for Public-coin Arguments
Kai-Min Chung and Feng-Hao Liu
Truly Efficient String Oblivious Transfer and SFE in Malicious and Covert Adversaries Models Using Resettable Tamper-Proof Tokens
Vladimir Kolesnikov
Two Is A Crowd? A Black-Box Separation Of One-Wayness and Security Under Correlated Inputs
Yevgeniy Vahlis