International Association for Cryptologic Research

Publications by Conference

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

Preface and frontmatter

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