Publications of tcc 2011

Page	Title
1	Input Locality and Hardness Amplification
19	General Hardness Amplification of Predicates and Puzzles
37	Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
55	Dense Model Theorems and Their Applications
58	Parallel Repetition for Leakage Resilience Amplification Revisited
70	Achieving Leakage Resilience Through Dual System Encryption
89	Signatures Resilient to Continual Leakage on Memory and Computation
107	After-the-Fact Leakage in Public-Key Encryption
125	One-Time Computable Self-Erasing Functions
144	Perfectly Secure Oblivious RAM Without Random Oracles
164	Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
182	Correlated-Input Secure Hash Functions
201	Black-Box Circular-Secure Encryption Beyond Affine Functions
219	Homomorphic Encryption: from Private-Key to Public-Key
235	Identity-Based Encryption Secure Against Selective Opening Attack
253	Functional Encryption: Definitions and Challenges
274	Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
293	Round-Optimal Password-Based Authenticated Key Exchange
311	Bringing People of Different Beliefs Together to do UC
329	Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
347	Practical Adaptive Oblivious Transfer from Simple Assumptions
364	Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
382	A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs
400	PCPs and the Hardness of Generating Private Synthetic Data
417	Limits of Computational Differential Privacy in the Client/Server Setting
432	Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
450	On the Black-Box Complexity of Optimally-Fair Coin Tossing
468	Tight Bounds for Classical and Quantum Coin Flipping
486	Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
504	Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators
522	On the Complexity of Non-Adaptively Increasing the Stretch of Pseudorandom Generators
540	Concurrent Security and Non-malleability
541	(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure Against Selective Opening Attacks
559	Limits On The Power of Zero-Knowledge Proofs in Cryptographic Constructions
579	Towards Non-Black-Box Lower Bounds in Cryptography
597	On Black-Box Separations among Injective One-Way Functions
615	Impossibility of Blind Signatures From One-Way Permutations