Accepted Papers



IACR logo

Linear Cryptanalysis

On Multiple Linear Approximations
Alex Biryukov, Christophe De Cannière and Michaël Quisquater

Feistel Schemes and Bi-linear Cryptanalysis
Nicolas T. Courtois

Group Signatures

Short Group Signatures
Dan Boneh, Xavier Boyen and Hovav Shacham

Signature Schemes and Anonymous Credentials from Bilinear Maps
Jan Camenisch and Anna Lysyanskaya

Invited Talk

(To Be Announced)
Victor Shoup


Complete Classification of Bilinear Hard-Core Functions
Thomas Holenstein, Ueli Maurer and Johan Sjödin

Finding Collisions on a Public Road, or Do Secure Hash Fuctions Need Secret Coins?
Chun-Yuan Hsiao and Leonid Reyzin

Security of Random Feistel Schemes with 5 or more rounds
Jacques Patarin

Efficient Representations

Signed Binary Representations Revisited
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn and Tsuyoshi Takagi

Compressed Pairings
Michael Scott and Paulo S. L. M. Barreto

Asymptotically Optimal Communication for Torus-Based Cryptography}
Marten van Dijk and David Woodruff

How to Compress Rabin Ciphertexts and Signatures (and More)
Craig Gentry

Public Key Cryptanalysis

On the Bounded Sum-of-digits Discrete Logarithm Problem in Finite Fields
Qi Cheng

Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring
Alexander May


Multi-trapdoor Commitments and their Applications to Proofs of Knowledge Secure under Concurrent Man-in-the-middle Attacks
Rosario Gennaro

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
Giovanni Di Crescenzo, Giuseppe Persiano and Ivan Visconti

Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
Ivan Damgård, Serge Fehr and Louis Salvail

The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols
Mihir Bellare and Adriana Palacio

Hash Collisions

Near-Collisions of SHA-0
Eli Biham and Rafi Chen

Multicollisions in iterated hash functions. Application to cascaded constructions
Antoine Joux

Secure Computation

Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
Masayuki Abe and Serge Fehr

Round-Optimal Secure Two-Party Computation
Jonathan Katz \and Rafail Ostrovsky

Invited Talk

Security, Liberty, and Electronic Communications
Susan Landau

Stream Cipher Cryptanalysis

An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators
Håvard Molland and Tor Helleseth

Rewriting Variables: the Complexity of Fast Algebraic Attacks on Stream Ciphers
Philip Hawkes and Gregory G. Rose

Faster Correlation Attack on Bluetooth Keystream Generator E0
Yi Lu and Serge Vaudenay

Public Key Encryption

A New Paradigm of Hybrid Encryption Scheme
Kaoru Kurosawa and Yvo Desmedt

Secure Identity Based Encryption Without Random Oracles
Dan Boneh and Xavier Boyen

Bounded Storage Model

Non-Interactive Timestamping in the Bounded Storage Model
Tal Moran, Ronen Shaltiel and Amnon Ta-Shma

Key Management

IPAKE: Isomorphisms for Password-based Authenticated Key Exchange
Dario Catalano, David Pointcheval and Thomas Pornin

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes
Yevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk and Tal Rabin

Efficient Tree-Based Revocation in Groups of Low-State Devices
Michael T. Goodrich, Jonathan Z. Sun and Roberto Tamassia

Computationally Unbounded Adversaries

Privacy-Preserving Datamining on Vertically Partitioned Databases
Cynthia Dwork and Kobbi Nissim

Optimal Perfectly Secure Message Transmission
K. Srinathan, Arvind Narayanan and C. Pandu Rangan

Pseudo-signatures, broadcast, and multi-party computation from correlated randomness
Matthias Fitzi, Stefan Wolf and Juerg Wullschleger

Back to Main