Publications of tcc 2012

Page	Title
1-20	Computing on Authenticated Data
21-38	Identifying Cheaters without an Honest Majority
39-53	On the Security of the "Free-XOR" Technique
54-74	Secure Two-Party Computation with Low Communication
75-93	Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
94-111	Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
112-132	On the Instantiability of Hash-and-Sign RSA Signatures
133-150	Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
151-168	On Efficient Zero-Knowledge PCPs
169-189	Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
190-208	Point Obfuscation and 3-Round Zero-Knowledge
209-229	Confidentiality and Integrity: A Constructive Perspective
230-247	Leakage-Resilient Circuits without Computational Assumptions
248-265	A Parallel Repetition Theorem for Leakage Resilience
266-284	Leakage-Tolerant Interactive Protocols
285-302	On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
303-320	Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
321-338	Lower Bounds in Differential Privacy
339-356	Iterative Constructions and Private Data Release
357-368	From Non-adaptive to Adaptive Pseudorandom Functions
369-382	Hardness Preserving Constructions of Pseudorandom Functions
383-403	Computational Extractors and Pseudorandomness
404-421	Functional Re-encryption and Collusion-Resistant Obfuscation
422-439	How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
440-457	On Black-Box Reductions between Predicate Encryption Schemes
458-475	Lossy Functions Do Not Amplify Well
476-493	Counterexamples to Hardness Amplification beyond Negligible
494-511	Resettable Statistical Zero Knowledge
512-529	The Knowledge Tightness of Parallel Zero-Knowledge
530-547	Simultaneously Resettable Arguments of Knowledge
548-563	Subspace LWE
564-581	Bounded-Collusion IBE from Key Homomorphism
582-599	A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
600-617	A Dichotomy for Local Small-Bias Generators
618-635	Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
636-653	Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations