## Seventh IACR Theory of Cryptography Conference## TCC 2010February 9-11, 2010, ETH ZurichZurich, Switzerland |

**Parallel Repetition Theorems for Interactive Arguments**

*Kai-Min Chung, Feng-Hao Liu*

**Almost Optimal Bounds for Direct Product Threshold Theorem**

*Charanjit S. Jutla*

**On Symmetric Encryption and Point Obfuscation**

*Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs*

**Obfuscation of Hyperplane Membership**

*Ran Canetti, Guy Rothblum, Mayank Varia*

**Privacy-Enhancing Cryptography: From Theory into Practice**

*Jan Camenisch*

**On Complete Primitives for Fairness**

*Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai*

**On the Necessary and Sufficient Assumptions for UC Computation**

*Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi*

**From Passive to Covert Security at Low Cost**

*Ivan Damgård, Martin Geisler, Jesper Buus Nielsen*

**A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems**

*Ronald Cramer, Dennis Hofheinz, Eike Kiltz*

**Two Is A Crowd? A Black-Box Separation Of One-Wayness and Security Under Correlated Inputs**

*Yevgeniy Vahlis*

**Efficient, Robust and Constant-Round Distributed RSA Key Generation**

*Ivan Damgård, Gert Læssøe Mikkelsen*

**Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems**

*Rikke Bendlin, Ivan Damgård*

**Ideal Hierarchical Secret Sharing Schemes**

*Oriol Farràs, Carles Padró*

**A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch**

*Ueli Maurer, Stefano Tessaro*

**On Related-Secret Pseudorandomness**

*David Goldenberg, Moses Liskov*

**A Domain Extender for the Ideal Cipher**

*Jean-Sebastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin*

**Delayed-Key Message Authentication for Streams**

*Marc Fischlin, Anja Lehmann*

**Founding Cryptography on Tamper-Proof Hardware Tokens**

*Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia*

**Truly Efficient String Oblivious Transfer Using Resettable
Tamper-Proof Tokens**

*Vladimir Kolesnikov*

**Leakage-Resilient Signatures**

*Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy Rothblum*

**Public-key Encryption Schemes with Auxiliary Inputs**

*Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan*

**Public-Key Cryptographic Primitives Provably as Secure as Subset Sum**

*Vadim Lyubashevsky, Adriana Palacio, Gil Segev*

**Rationality in the Full-Information Model**

*Ronen Gradwohl*

**Efficient Rational Secret Sharing in Standard Communication Networks**

*Georg Fuchsbauer, Jonathan Katz, David Naccache*

**Bounds on the Sample Complexity for Private Learning and Private Data Release**

*Amos Beimel, Shiva Kasiviswanathan, Kobbi Nissim*

**New Techniques for Dual System
Encryption and Fully Secure HIBE with Short Ciphertexts**

*Allison B. Lewko, Brent Waters*

**Robust Encryption**

*Michel Abdalla, Mihir Bellare, Gregory Neven*

**Secure Computation and Its Diverse Applications
**

*Yuval Ishai*

**Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs**

*Benoit Libert, Moti Yung*

**Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model**

*Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam*

**Efficiency Preserving Transformations for Concurrent Non-Malleable Zero-Knowledge**

*Rafail Ostrovsky, Omkant Pandey, Ivan Visconti*

**Efficiency Limitations for Sigma-Protocols for Group Homomorphisms**

*Endre Bangerter, Jan Camenisch, Stephan Krenn*

**Composition of Zero-Knowledge Proofs with Efficient Provers**

*Eleanor Birrell, Salil Vadhan*

**Private Coins versus Public Coins in Zero-Knowledge Proof Systems**

*Rafael Pass, Muthuramakrishnan Venkitasubramaniam*