Abstract is missing.
- An Efficient Parallel Repetition TheoremJohan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak. 1-18 [doi]
- Parallel Repetition Theorems for Interactive ArgumentsKai-Min Chung, Feng-Hao Liu. 19-36 [doi]
- Almost Optimal Bounds for Direct Product Threshold TheoremCharanjit S. Jutla. 37-51 [doi]
- On Symmetric Encryption and Point ObfuscationRan Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs. 52-71 [doi]
- Obfuscation of Hyperplane MembershipRan Canetti, Guy N. Rothblum, Mayank Varia. 72-89 [doi]
- Secure Computation and Its Diverse ApplicationsYuval Ishai. 90 [doi]
- On Complete Primitives for FairnessS. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai. 91-108 [doi]
- On the Necessary and Sufficient Assumptions for UC ComputationIvan Damgård, Jesper Buus Nielsen, Claudio Orlandi. 109-127 [doi]
- From Passive to Covert Security at Low CostIvan Damgård, Martin Geisler, Jesper Buus Nielsen. 128-145 [doi]
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search ProblemsRonald Cramer, Dennis Hofheinz, Eike Kiltz. 146-164 [doi]
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated InputsYevgeniy Vahlis. 165-182 [doi]
- Efficient, Robust and Constant-Round Distributed RSA Key GenerationIvan Damgård, Gert Læssøe Mikkelsen. 183-200 [doi]
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based CryptosystemsRikke Bendlin, Ivan Damgård. 201-218 [doi]
- Ideal Hierarchical Secret Sharing SchemesOriol Farrà s, Carles Padró. 219-236 [doi]
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal StretchUeli M. Maurer, Stefano Tessaro. 237-254 [doi]
- On Related-Secret PseudorandomnessDavid Goldenberg, Moses Liskov. 255-272 [doi]
- A Domain Extender for the Ideal CipherJean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin. 273-289 [doi]
- Delayed-Key Message Authentication for StreamsMarc Fischlin, Anja Lehmann. 290-307 [doi]
- Founding Cryptography on Tamper-Proof Hardware TokensVipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia. 308-326 [doi]
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof TokensVladimir Kolesnikov. 327-342 [doi]
- Leakage-Resilient SignaturesSebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum. 343-360 [doi]
- Public-Key Encryption Schemes with Auxiliary InputsYevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan. 361-381 [doi]
- Public-Key Cryptographic Primitives Provably as Secure as Subset SumVadim Lyubashevsky, Adriana Palacio, Gil Segev. 382-400 [doi]
- Rationality in the Full-Information ModelRonen Gradwohl. 401-418 [doi]
- Efficient Rational Secret Sharing in Standard Communication NetworksGeorg Fuchsbauer, Jonathan Katz, David Naccache. 419-436 [doi]
- Bounds on the Sample Complexity for Private Learning and Private Data ReleaseAmos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim. 437-454 [doi]
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short CiphertextsAllison B. Lewko, Brent Waters. 455-479 [doi]
- Robust EncryptionMichel Abdalla, Mihir Bellare, Gregory Neven. 480-497 [doi]
- Privacy-Enhancing Cryptography: From Theory into PracticeJan Camenisch. 498 [doi]
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short ProofsBenoît Libert, Moti Yung. 499-517 [doi]
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing ModelRafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam. 518-534 [doi]
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero KnowledgeRafail Ostrovsky, Omkant Pandey, Ivan Visconti. 535-552 [doi]
- Efficiency Limitations for Σ-Protocols for Group HomomorphismsEndre Bangerter, Jan Camenisch, Stephan Krenn. 553-571 [doi]
- Composition of Zero-Knowledge Proofs with Efficient ProversEleanor Birrell, Salil P. Vadhan. 572-587 [doi]
- Private Coins versus Public Coins in Zero-Knowledge Proof SystemsRafael Pass, Muthuramakrishnan Venkitasubramaniam. 588-605 [doi]