Front matter
1-26
Factoring Large Numbers with the TWIRL Device
Adi Shamir and Eran Tromer
27-43
New Partial Key Exposure Attacks on RSA
Johannes Blömer and Alexander May
44-60
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
Jean-Charles Faugère and Antoine Joux
61-77
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
Salil P. Vadhan
78-95
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
Renato Renner and Stefan Wolf
96-109
On Cryptographic Assumptions and Challenges
Moni Naor
110-125
Scalable Protocols for Authenticated Group Key Exchange
Jonathan Katz and Moti Yung
126-144
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Jan Camenisch and Victor Shoup
145-161
Extending Oblivious Transfers Efficiently
Yuval Ishai, Joe Kilian, Kobbi Nissim and Erez Petrank
162-175
Algebraic Attacks on Combiners with Memory
Frederik Armknecht and Matthias Krause
176-194
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Nicolas T. Courtois
195-211
Cryptanalysis of Safer++
Alex Biryukov, Christophe De Cannière and Gustaf Dellkrantz
212-225
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem
Jung Hee Cheon and Byungheup Jun
226-246
The Impact of Decryption Failures on the Security of NTRU Encryption
Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos and Joseph H. Silverman, et al.
247-264
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
Ivan Damgård and Jesper Buus Nielsen
265-281
Universal Composition with Joint State
Ran Canetti and Tal Rabin
282-298
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
Daniele Micciancio and Salil P. Vadhan
299-315
Derandomization in Cryptography
Boaz Barak, Shien Jin Ong and Salil Vadhan
316-337
On Deniability in the Common Reference String and Random Oracle Model
Rafael Pass
338-348
Primality Proving via One Round in ECPP and One Iteration in AKS
Qi Cheng
349-365
Torus-Based Cryptography
Karl Rubin and Alice Silverberg
366-382
Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation
Yuichi Komano and Kazuo Ohta
383-399
Multipurpose Identity-Based Signcryption
A Swiss Army Knife for Identity-Based Cryptography
Xavier Boyen
400-425
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols
Hugo Krawczyk
426-444
On Memory-Bound Functions for Fighting Spam
Cynthia Dwork, Andrew Goldberg and Moni Naor
445-462
Lower and Upper Bounds on Obtaining History Independence
Niv Buchbinder and Erez Petrank
463-481
Private Circuits: Securing Hardware against Probing Attacks
Yuval Ishai, Amit Sahai and David Wagner
482-499
A Tweakable Enciphering Mode
Shai Halevi and Phillip Rogaway
500-512
A Message Authentication Code Based on Unimodular Matrix Groups
Matthew Cary and Ramarathnam Venkatesan
513-529
Luby-Rackoff: 7 Rounds Are Enough for 2n(1 − ε) Security
Jacques Patarin
530-547
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Omer Horvitz and Virgil Gligor
548-564
Plaintext Awareness via Key Registration
Jonathan Herzog, Moses Liskov and Silvio Micali
565-582
Relaxing Chosen-Ciphertext Security
Ran Canetti, Hugo Krawczyk and Jesper B. Nielsen
583-599
Password Interception in a SSL/TLS Channel
Brice Canvel, Alain Hiltgen, Serge Vaudenay and Martin Vuagnoux
600-616
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
Elad Barkan, Eli Biham and Nathan Keller
617-630
Making a Faster Cryptanalytic Time-Memory Trade-Off
Philippe Oechslin
Back matter