Publications of tcc 2010

Page	Title
1-18	An Efficient Parallel Repetition Theorem
19-36	Parallel Repetition Theorems for Interactive Arguments
37-51	Almost Optimal Bounds for Direct Product Threshold Theorem
52-71	On Symmetric Encryption and Point Obfuscation
72-89	Obfuscation of Hyperplane Membership
90	Secure Computation and Its Diverse Applications
91-108	On Complete Primitives for Fairness
109-127	On the Necessary and Sufficient Assumptions for UC Computation
128-145	From Passive to Covert Security at Low Cost
146-164	A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
165-182	Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
183-200	Efficient, Robust and Constant-Round Distributed RSA Key Generation
201-218	Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
219-236	Ideal Hierarchical Secret Sharing Schemes
237-254	A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
255-272	On Related-Secret Pseudorandomness
273-289	A Domain Extender for the Ideal Cipher
290-307	Delayed-Key Message Authentication for Streams
308-326	Founding Cryptography on Tamper-Proof Hardware Tokens
327-342	Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
343-360	Leakage-Resilient Signatures
361-381	Public-Key Encryption Schemes with Auxiliary Inputs
382-400	Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
401-418	Rationality in the Full-Information Model
419-436	Efficient Rational Secret Sharing in Standard Communication Networks
437-454	Bounds on the Sample Complexity for Private Learning and Private Data Release
455-479	New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
480-497	Robust Encryption
498	Privacy-Enhancing Cryptography: From Theory into Practice
499-517	Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
518-534	Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
535-552	Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
553-571	Efficiency Limitations for ?-Protocols for Group Homomorphisms
572-587	Composition of Zero-Knowledge Proofs with Efficient Provers
588-605	Private Coins versus Public Coins in Zero-Knowledge Proof Systems