Abstract is missing.
- The Random Oracle Model and the Ideal Cipher Model Are EquivalentJean-Sébastien Coron, Jacques Patarin, Yannick Seurin. 1-20 [doi]
- Programmable Hash Functions and Their ApplicationsDennis Hofheinz, Eike Kiltz. 21-38 [doi]
- One-Time ProgramsShafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum. 39-56 [doi]
- Adaptive One-Way Functions and ApplicationsOmkant Pandey, Rafael Pass, Vinod Vaikuntanathan. 57-74 [doi]
- Bits Security of the Elliptic Curve Diffie-Hellman Secret KeysDimitar Jetchev, Ramarathnam Venkatesan. 75-92 [doi]
- Improved Bounds on Security Reductions for Discrete Log Based SignaturesSanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam. 93-107 [doi]
- Circular-Secure Encryption from Decision Diffie-HellmanDan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky. 108-125 [doi]
- Public-Key Locally-Decodable CodesBrett Hemenway, Rafail Ostrovsky. 126-143 [doi]
- Key-Recovery Attacks on Universal Hash Function Based MAC AlgorithmsHelena Handschuh, Bart Preneel. 144-161 [doi]
- Cryptanalysis of the GOST Hash FunctionFlorian Mendel, Norbert Pramstaller, Christian Rechberger, Marcin Kontak, Janusz Szmidt. 162-178 [doi]
- Preimages for Reduced SHA-0 and SHA-1Christophe De Cannière, Christian Rechberger. 179-202 [doi]
- On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoqCode Hopping SchemeThomas Eisenbarth, Timo Kasper, Amir Moradi, Christof Paar, Mahmoud Salmasizadeh, Mohammad T. Manzuri Shalmani. 203-220 [doi]
- Bug AttacksEli Biham, Yaniv Carmeli, Adi Shamir. 221-240 [doi]
- Scalable Multiparty Computation with Nearly Optimal Work and ResilienceIvan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith. 241-261 [doi]
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and SeparationsManoj Prabhakaran, Mike Rosulek. 262-279 [doi]
- Cryptanalysis of MinRankJean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret. 280-296 [doi]
- New State Recovery Attack on RC4Alexander Maximov, Dmitry Khovratovich. 297-316 [doi]
- Dynamic Threshold Public-Key EncryptionCécile Delerablée, David Pointcheval. 317-334 [doi]
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random OraclesAlexandra Boldyreva, Serge Fehr, Adam O Neill. 335-359 [doi]
- Deterministic Encryption: Definitional Equivalences and Constructions without Random OraclesMihir Bellare, Marc Fischlin, Adam O Neill, Thomas Ristenpart. 360-378 [doi]
- Communication Complexity in Algebraic Two-Party ProtocolsRafail Ostrovsky, William E. Skeith III. 379-396 [doi]
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression FunctionsMartijn Stam. 397-412 [doi]
- Compression from Collisions, or Why CRHF Combiners Have a Long OutputKrzysztof Pietrzak. 413-432 [doi]
- Constructing Cryptographic Hash Functions from Fixed-Key BlockciphersPhillip Rogaway, John P. Steinberger. 433-450 [doi]
- Distributed Private Data Analysis: Simultaneously Solving How and WhatAmos Beimel, Kobbi Nissim, Eran Omri. 451-468 [doi]
- New Efficient Attacks on Statistical Disclosure Control MechanismsCynthia Dwork, Sergey Yekhanin. 469-480 [doi]
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded AdversariesPayman Mohassel, Enav Weinreb. 481-496 [doi]
- Collusion-Free Protocols in the Mediated ModelJoël Alwen, Abhi Shelat, Ivan Visconti. 497-514 [doi]
- Efficient Constructions of Composable Commitments and Zero-Knowledge ProofsYevgeniy Dodis, Victor Shoup, Shabsi Walfish. 515-535 [doi]
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice ProblemsChris Peikert, Vinod Vaikuntanathan. 536-553 [doi]
- A Framework for Efficient and Composable Oblivious TransferChris Peikert, Vinod Vaikuntanathan, Brent Waters. 554-571 [doi]
- Founding Cryptography on Oblivious Transfer - EfficientlyYuval Ishai, Manoj Prabhakaran, Amit Sahai. 572-591 [doi]