Abstract is missing.
- Computing on Authenticated DataJae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohenberger, Abhi Shelat, Brent Waters. 1-20 [doi]
- Identifying Cheaters without an Honest MajorityYuval Ishai, Rafail Ostrovsky, Hakan Seyalioglu. 21-38 [doi]
- On the Security of the "Free-XOR" TechniqueSeung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou. 39-53 [doi]
- Secure Two-Party Computation with Low CommunicationIvan Damgård, Sebastian Faust, Carmit Hazay. 54-74 [doi]
- Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and ConstructionsBenoît Libert, Moti Yung. 75-93 [doi]
- Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash FunctionsOlivier Blazy, David Pointcheval, Damien Vergnaud. 94-111 [doi]
- On the Instantiability of Hash-and-Sign RSA SignaturesYevgeniy Dodis, Iftach Haitner, Aris Tentes. 112-132 [doi]
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind SignaturesJae Hong Seo, Jung Hee Cheon. 133-150 [doi]
- On Efficient Zero-Knowledge PCPsYuval Ishai, Mohammad Mahmoody, Amit Sahai. 151-168 [doi]
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge ArgumentsHelger Lipmaa. 169-189 [doi]
- Point Obfuscation and 3-Round Zero-KnowledgeNir Bitansky, Omer Paneth. 190-208 [doi]
- Confidentiality and Integrity: A Constructive PerspectiveUeli Maurer, Andreas Rüedlinger, Björn Tackmann. 209-229 [doi]
- Leakage-Resilient Circuits without Computational AssumptionsStefan Dziembowski, Sebastian Faust. 230-247 [doi]
- A Parallel Repetition Theorem for Leakage ResilienceZvika Brakerski, Yael Tauman Kalai. 248-265 [doi]
- Leakage-Tolerant Interactive ProtocolsNir Bitansky, Ran Canetti, Shai Halevi. 266-284 [doi]
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel ConstructionAvradip Mandal, Jacques Patarin, Yannick Seurin. 285-302 [doi]
- Collisions Are Not Incidental: A Compression Function Exploiting Discrete GeometryDimitar Jetchev, Onur Özen, Martijn Stam. 303-320 [doi]
- Lower Bounds in Differential PrivacyAnindya De. 321-338 [doi]
- Iterative Constructions and Private Data ReleaseAnupam Gupta, Aaron Roth, Jonathan Ullman. 339-356 [doi]
- From Non-adaptive to Adaptive Pseudorandom FunctionsItay Berman, Iftach Haitner. 357-368 [doi]
- Hardness Preserving Constructions of Pseudorandom FunctionsAbhishek Jain 0002, Krzysztof Pietrzak, Aris Tentes. 369-382 [doi]
- Computational Extractors and PseudorandomnessDana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin. 383-403 [doi]
- Functional Re-encryption and Collusion-Resistant ObfuscationNishanth Chandran, Melissa Chase, Vinod Vaikuntanathan. 404-421 [doi]
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based EncryptionBryan Parno, Mariana Raykova 0001, Vinod Vaikuntanathan. 422-439 [doi]
- On Black-Box Reductions between Predicate Encryption SchemesVipul Goyal, Virendra Kumar, Satyanarayana V. Lokam, Mohammad Mahmoody. 440-457 [doi]
- Lossy Functions Do Not Amplify WellKrzysztof Pietrzak, Alon Rosen, Gil Segev. 458-475 [doi]
- Counterexamples to Hardness Amplification beyond NegligibleYevgeniy Dodis, Abhishek Jain 0002, Tal Moran, Daniel Wichs. 476-493 [doi]
- Resettable Statistical Zero KnowledgeSanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia. 494-511 [doi]
- The Knowledge Tightness of Parallel Zero-KnowledgeKai-Min Chung, Rafael Pass, Wei-Lung Dustin Tseng. 512-529 [doi]
- Simultaneously Resettable Arguments of KnowledgeChongwon Cho, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti. 530-547 [doi]
- Subspace LWEKrzysztof Pietrzak. 548-563 [doi]
- Bounded-Collusion IBE from Key HomomorphismShafi Goldwasser, Allison B. Lewko, David A. Wilson. 564-581 [doi]
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational EntropyBenjamin Fuller, Adam O'Neill, Leonid Reyzin. 582-599 [doi]
- A Dichotomy for Local Small-Bias GeneratorsBenny Applebaum, Andrej Bogdanov, Alon Rosen. 600-617 [doi]
- Randomness Condensers for Efficiently Samplable, Seed-Dependent SourcesYevgeniy Dodis, Thomas Ristenpart, Salil P. Vadhan. 618-635 [doi]
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor PermutationsDario Fiore, Dominique Schröder. 636-653 [doi]