CRYPTO 2007

Santa Barbara, California, USA

Alfred Menezes (Ed.): Advances in Cryptology - CRYPTO ‘07: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings Lecture Notes in Computer Science Volume 4622/2007, Springer, 2007, ISBN 978-3-540-74142-8

Read the paper abstracts. More »

Cryptanalysis I

• Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, and Jacques Stern: Practical Cryptanalysis of SFLASH p. 1
• Pierre-Alain Fouque, Ga¨etan Leurent, and Phong Q. Nguyen: Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 p. 13

Secure Searching

• Amos Beimel, Tal Malkin, Kobbi Nissim, and Enav Weinreb: How Should We Solve Search Problems Privately? p. 31
• Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, and William E. Skeith III: Public Key Encryption That Allows PIR Queries p. 50

Invited Talk

• Ross Anderson and Tyler Moore: Information Security Economics – and Beyond p. 68

Theory I

• Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz: Cryptography with Constant Input Locality p. 92
• Omer Horvitz and Jonathan Katz: Universally-Composable Two-Party Computation in Two Rounds p. 111
• Ueli Maurer, Krzysztof Pietrzak, and Renato Renner: Indistinguishability Amplification p. 130

Lattices

• Nick Howgrave-Graham: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRUp. 150
• Guillaume Hanrot and Damien Stehl´e: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm (Extended Abstract) p. 170

Random Oracles

• Ueli Maurer and Stefano Tessaro: Domain Extension of Public Random Functions: Beyond the Birthday Barrier p. 187
• Dominique Unruh: Random Oracles and Auxiliary Input p. 205

Hash Functions

• Marc Fischlin and Anja Lehmann: Security-Amplifying Combiners for Collision-Resistant Hash Functions p. 224
• Antoine Joux and Thomas Peyrin: Hash Functions and the (Amplified) Boomerang Attack p. 244
• Ran Canetti, Ron Rivest, Madhu Sudan, Luca Trevisan,Salil Vadhan, and Hoeteck Wee: Amplifying Collision Resistance: A Complexity-Theoretic Treatment p. 264

Theory II

• Danny Harnik, Yuval Ishai, and Eyal Kushilevitz: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? p. 284
• Melissa Chase and Anna Lysyanskaya: Simulatable VRFs with Applications to Multi-theorem NIZK p. 303
• Jens Groth and Rafail Ostrovsky: Cryptography in the Multi-string Model p. 323

Quantum Cryptography

• Ivan B. Damg°ard, Serge Fehr, Louis Salvail, and Christian Schaffner: Secure Identification and QKD in the Bounded-Quantum-Storage Model p. 342
• Ivan B. Damg°ard, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner: A Tight High-Order Entropic Quantum Uncertainty Relation with Applications p. 360

Cryptanalysis II

• Jean-S´ebastien Coron: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach p. 379
• Ellen Jochemsz and Alexander May: A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N0.073 p. 395

Encryption

• Shai Halevi: Invertible Universal Hashing and the TET Encryption Mode p. 412
• Vipul Goyal: Reducing Trust in the PKG in Identity Based Cryptosystems p. 430
• Aggelos Kiayias and Serdar Pehlivanoglu: Pirate Evolution: How to Make the Most of Your Traitor Keys p. 448

Protocol Analysis

• Daniel R.L. Brown and Kristian Gjøsteen: A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator p. 466
• Emmanuel Bresson, Yassine Lakhnech, Laurent Mazar´e, and Bogdan Warinschi: A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness p. 482
• Russell Impagliazzo, Ragesh Jaiswal, and Valentine Kabanets: Chernoff-Type Direct Product Theorems p. 500

Public-Key Encryption

• Manoj Prabhakaran and Mike Rosulek: Rerandomizable RCCA Encryption p. 517
• Mihir Bellare, Alexandra Boldyreva, and Adam O’Neill: Deterministic and Efficiently Searchable Encryption p. 535
• Dennis Hofheinz and Eike Kiltz: Secure Hybrid Encryption from Weakened Key Encapsulation p. 553

Multi-party Computation

• Ivan Damg°ard and Jesper Buus Nielsen: Scalable and Unconditionally Secure Multiparty Computation p. 572
• Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, and Huaxiong Wang: On Secure Multi-party Computation in Black-Box Groups p. 591
• Ronald Cramer, Eike Kiltz, and Carles Padr´o: A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra p. 613