Theory Of Cryptography: 9th Theory Of Cryptography Conference, Tcc 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings (lecture Notes In Computer Science)

This book constitutes the thoroughly refereed proceedings of the 9th Theory of Cryptography Conference, TCC 2012, held in Taormina, Sicily, Italy, in March 2012. The 36 revised full papers presented were carefully reviewed and selected from 131 submissions. The papers are organized in topical sections on secure computation; (blind) signatures and threshold encryption; zero-knowledge and security models; leakage-resilience; hash functions; differential privacy; pseudorandomness; dedicated encryption; security amplification; resettable and parallel zero knowledge. Front Matter....Pages - Computing on Authenticated Data....Pages 1-20 Identifying Cheaters without an Honest Majority....Pages 21-38 On the Security of the “Free-XOR” Technique....Pages 39-53 Secure Two-Party Computation with Low Communication....Pages 54-74 Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions....Pages 75-93 Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions....Pages 94-111 On the Instantiability of Hash-and-Sign RSA Signatures....Pages 112-132 Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures....Pages 133-150 On Efficient Zero-Knowledge PCPs....Pages 151-168 Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments....Pages 169-189 Point Obfuscation and 3-Round Zero-Knowledge....Pages 190-208 Confidentiality and Integrity: A Constructive Perspective....Pages 209-229 Leakage-Resilient Circuits without Computational Assumptions....Pages 230-247 A Parallel Repetition Theorem for Leakage Resilience....Pages 248-265 Leakage-Tolerant Interactive Protocols....Pages 266-284 On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction....Pages 285-302 Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry....Pages 303-320 Lower Bounds in Differential Privacy....Pages 321-338 Iterative Constructions and Private Data Release....Pages 339-356 From Non-adaptive to Adaptive Pseudorandom Functions....Pages 357-368 Hardness Preserving Constructions of Pseudorandom Functions....Pages 369-382 Computational Extractors and Pseudorandomness....Pages 383-403 Functional Re-encryption and Collusion-Resistant Obfuscation....Pages 404-421 How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption....Pages 422-439 On Black-Box Reductions between Predicate Encryption Schemes....Pages 440-457 Lossy Functions Do Not Amplify Well....Pages 458-475 Counterexamples to Hardness Amplification beyond Negligible....Pages 476-493 Resettable Statistical Zero Knowledge....Pages 494-511 The Knowledge Tightness of Parallel Zero-Knowledge....Pages 512-529 Simultaneously Resettable Arguments of Knowledge....Pages 530-547 Subspace LWE....Pages 548-563 Bounded-Collusion IBE from Key Homomorphism....Pages 564-581 A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy....Pages 582-599 A Dichotomy for Local Small-Bias Generators....Pages 600-617 Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources....Pages 618-635 Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations....Pages 636-653 Back Matter....Pages - This book constitutes the thoroughly refereed proceedings of the 10th Theory of Cryptography Conference, TCC 2013, held in Tokyo, Japan, in March 2013. The papers cover topics such as study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization;