Advances in Cryptology – CRYPTO 2007: 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007. Proceedings

Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern (auth.), Alfred Menezes (eds.)3540741429, 9783540741428

The 27th Annual International Cryptology Conference was held in Santa Barbara, California, in August 2007. The conference drew researchers from around the world who came to present their findings and discuss the latest developments in the field. This book constitutes the refereed proceedings of the conference.

Thirty-three full papers are presented along with one important invited lecture. Each one has been carefully reviewed by the editor to ensure that all papers are accurate, easy to read, and make an important contribution to the field.

The papers address current foundational, theoretical, and research aspects of cryptology, cryptography, and cryptanalysis. In addition, readers will discover many advanced and emerging applications.

---

Table of contents :
Front Matter….Pages –
Practical Cryptanalysis of SFLASH….Pages 1-12
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5….Pages 13-30
How Should We Solve Search Problems Privately?….Pages 31-49
Public Key Encryption That Allows PIR Queries….Pages 50-67
Information Security Economics – and Beyond….Pages 68-91
Cryptography with Constant Input Locality….Pages 92-110
Universally-Composable Two-Party Computation in Two Rounds….Pages 111-129
Indistinguishability Amplification….Pages 130-149
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU….Pages 150-169
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm….Pages 170-186
Domain Extension of Public Random Functions: Beyond the Birthday Barrier….Pages 187-204
Random Oracles and Auxiliary Input….Pages 205-223
Security-Amplifying Combiners for Collision-Resistant Hash Functions….Pages 224-243
Hash Functions and the (Amplified) Boomerang Attack….Pages 244-263
Amplifying Collision Resistance: A Complexity-Theoretic Treatment….Pages 264-283
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?….Pages 284-302
Simulatable VRFs with Applications to Multi-theorem NIZK….Pages 303-322
Cryptography in the Multi-string Model….Pages 323-341
Secure Identification and QKD in the Bounded-Quantum-Storage Model….Pages 342-359
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications….Pages 360-378
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach….Pages 379-394
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 ….Pages 395-411
Invertible Universal Hashing and the TET Encryption Mode….Pages 412-429
Reducing Trust in the PKG in Identity Based Cryptosystems….Pages 430-447
Pirate Evolution: How to Make the Most of Your Traitor Keys….Pages 448-465
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator….Pages 466-481
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness….Pages 482-499
Chernoff-Type Direct Product Theorems….Pages 500-516
Rerandomizable RCCA Encryption….Pages 517-534
Deterministic and Efficiently Searchable Encryption….Pages 535-552
Secure Hybrid Encryption from Weakened Key Encapsulation….Pages 553-571
Scalable and Unconditionally Secure Multiparty Computation….Pages 572-590
On Secure Multi-party Computation in Black-Box Groups….Pages 591-612
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra….Pages 613-630
Back Matter….Pages –