Abstract is missing.
- Practical Cryptanalysis of SFLASHVivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern. 1-12 [doi]
- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen. 13-30 [doi]
- How Should We Solve Search Problems Privately?Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb. 31-49 [doi]
- Public Key Encryption That Allows PIR QueriesDan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III. 50-67 [doi]
- Information Security Economics - and BeyondRoss Anderson, Tyler Moore. 68-91 [doi]
- Cryptography with Constant Input LocalityBenny Applebaum, Yuval Ishai, Eyal Kushilevitz. 92-110 [doi]
- Universally-Composable Two-Party Computation in Two RoundsOmer Horvitz, Jonathan Katz. 111-129 [doi]
- Indistinguishability AmplificationUeli M. Maurer, Krzysztof Pietrzak, Renato Renner. 130-149 [doi]
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRUNick Howgrave-Graham. 150-169 [doi]
- Improved Analysis of Kannan s Shortest Lattice Vector AlgorithmGuillaume Hanrot, Damien Stehlé. 170-186 [doi]
- Domain Extension of Public Random Functions: Beyond the Birthday BarrierUeli M. Maurer, Stefano Tessaro. 187-204 [doi]
- Random Oracles and Auxiliary InputDominique Unruh. 205-223 [doi]
- Security-Amplifying Combiners for Collision-Resistant Hash FunctionsMarc Fischlin, Anja Lehmann. 224-243 [doi]
- Hash Functions and the (Amplified) Boomerang AttackAntoine Joux, Thomas Peyrin. 244-263 [doi]
- Amplifying Collision Resistance: A Complexity-Theoretic TreatmentRan Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee. 264-283 [doi]
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?Danny Harnik, Yuval Ishai, Eyal Kushilevitz. 284-302 [doi]
- Simulatable VRFs with Applications to Multi-theorem NIZKMelissa Chase, Anna Lysyanskaya. 303-322 [doi]
- Cryptography in the Multi-string ModelJens Groth, Rafail Ostrovsky. 323-341 [doi]
- Secure Identification and QKD in the Bounded-Quantum-Storage ModelIvan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner. 342-359 [doi]
- A Tight High-Order Entropic Quantum Uncertainty Relation with ApplicationsIvan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner. 360-378 [doi]
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct ApproachJean-Sébastien Coron. 379-394 [doi]
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than ::::N:::: :::0.073:::Ellen Jochemsz, Alexander May. 395-411 [doi]
- Invertible Universal Hashing and the TET Encryption ModeShai Halevi. 412-429 [doi]
- Reducing Trust in the PKG in Identity Based CryptosystemsVipul Goyal. 430-447 [doi]
- Pirate Evolution: How to Make the Most of Your Traitor KeysAggelos Kiayias, Serdar Pehlivanoglu. 448-465 [doi]
- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number GeneratorDaniel R. L. Brown, Kristian Gjøsteen. 466-481 [doi]
- A Generalization of DDH with Applications to Protocol Analysis and Computational SoundnessEmmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi. 482-499 [doi]
- Chernoff-Type Direct Product TheoremsRussell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets. 500-516 [doi]
- Rerandomizable RCCA EncryptionManoj Prabhakaran, Mike Rosulek. 517-534 [doi]
- Deterministic and Efficiently Searchable EncryptionMihir Bellare, Alexandra Boldyreva, Adam O Neill. 535-552 [doi]
- Secure Hybrid Encryption from Weakened Key EncapsulationDennis Hofheinz, Eike Kiltz. 553-571 [doi]
- Scalable and Unconditionally Secure Multiparty ComputationIvan Damgård, Jesper Buus Nielsen. 572-590 [doi]
- On Secure Multi-party Computation in Black-Box GroupsYvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang. 591-612 [doi]
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear AlgebraRonald Cramer, Eike Kiltz, Carles Padró. 613-630 [doi]