Abstract is missing.
- Reconstructing RSA Private Keys from Random Key BitsNadia Heninger, Hovav Shacham. 1-17 [doi]
- Public-Key Cryptosystems Resilient to Key LeakageMoni Naor, Gil Segev. 18-35 [doi]
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval ModelJoël Alwen, Yevgeniy Dodis, Daniel Wichs. 36-54 [doi]
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA CertificateMarc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger. 55-69 [doi]
- Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1Kazumaro Aoki, Yu Sasaki. 70-89 [doi]
- Private Mutual Authentication and Conditional Oblivious TransferStanislaw Jarecki, Xiaomin Liu. 90-107 [doi]
- Randomizable Proofs and Delegatable Anonymous CredentialsMira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham. 108-125 [doi]
- Computational Differential PrivacyIlya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan. 126-142 [doi]
- Probabilistically Checkable ArgumentsYael Tauman Kalai, Ran Raz. 143-159 [doi]
- On the Composition of Public-Coin Zero-Knowledge ProtocolsRafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström. 160-176 [doi]
- On the Amortized Complexity of Zero-Knowledge ProtocolsRonald Cramer, Ivan Damgård. 177-191 [doi]
- Linear Algebra with Sub-linear Zero-Knowledge ArgumentsJens Groth. 192-208 [doi]
- New Birthday Attacks on Some MACs Based on Block CiphersZheng Yuan, Wei Wang, Keting Jia, Guangwu Xu, Xiaoyun Wang. 209-230 [doi]
- Distinguisher and Related-Key Attack on the Full AES-256Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic. 231-249 [doi]
- Cryptanalysis of C2Julia Borghoff, Lars R. Knudsen, Gregor Leander, Krystian Matusiewicz. 250-266 [doi]
- Message Authentication Codes from Unpredictable Block CiphersYevgeniy Dodis, John P. Steinberger. 267-285 [doi]
- How to Encipher Messages on a Small DomainBen Morris, Phillip Rogaway, Till Stegers. 286-302 [doi]
- How to Hash into Elliptic CurvesThomas Icart. 303-316 [doi]
- Batch Binary EdwardsDaniel J. Bernstein. 317-336 [doi]
- Solving Hidden Number Problem with One Bit Oracle and AdviceAdi Akavia. 337-354 [doi]
- Computational Indistinguishability Amplification: Tight Product Theorems for System CompositionUeli M. Maurer, Stefano Tessaro. 355-373 [doi]
- Merkle Puzzles Are Optimal - An ::::O::::(::::n:::::::2:::)-Query Attack on Any Key Exchange from a Random OracleBoaz Barak, Mohammad Mahmoody-Ghidary. 374-390 [doi]
- Position Based CryptographyNishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky. 391-407 [doi]
- Improving the Security of Quantum Protocols via Commit-and-OpenIvan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner. 408-427 [doi]
- Practical Cryptanalysis of iso/iec 9796-2 and emv SignaturesJean-Sébastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann. 428-444 [doi]
- How Risky Is the Random-Oracle Model?Gaëtan Leurent, Phong Q. Nguyen. 445-464 [doi]
- Abstraction in CryptographyUeli M. Maurer. 465 [doi]
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over ::::Any:::: Fixed Finite FieldIgnacio Cascudo Pueyo, Hao Chen, Ronald Cramer, Chaoping Xing. 466-486 [doi]
- The Round Complexity of Verifiable Secret Sharing RevisitedArpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan. 487-504 [doi]
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious TransferJuan A. Garay, Daniel Wichs, Hong-Sheng Zhou. 505-523 [doi]
- Collusion-Free Multiparty Computation in the Mediated ModelJoël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti. 524-540 [doi]
- Privacy-Enhancing Auctions Using Rational CryptographyPeter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos. 541-558 [doi]
- Utility Dependence in Correct and Fair Rational Secret SharingGilad Asharov, Yehuda Lindell. 559-576 [doi]
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance ProblemVadim Lyubashevsky, Daniele Micciancio. 577-594 [doi]
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsBenny Applebaum, David Cash, Chris Peikert, Amit Sahai. 595-618 [doi]
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple AssumptionsBrent Waters. 619-636 [doi]
- The Group of Signed Quadratic Residues and ApplicationsDennis Hofheinz, Eike Kiltz. 637-653 [doi]
- Short and Stateless Signatures from the RSA AssumptionSusan Hohenberger, Brent Waters. 654-670 [doi]
- Smooth Projective Hashing for Conditionally Extractable CommitmentsMichel Abdalla, Céline Chevalier, David Pointcheval. 671-689 [doi]