CRYPTO 2004

List of Accepted Papers

Signature Schemes and Anonymous Credentials from Bilinear Maps,

Jan Camenisch (IBM Zurich) and Anna Lysyanskaya (Brown Univ.)

Compressed Pairings,

Michael Scott (Dublin City Univ.), Paulo S. L. M. Barreto (Univ. de Sao Paulo)

On Multiple Linear Approximations,

Alex Biryukov and Christophe De Cannlere and Michael Quisquater (Katholieke Univ. Leuven)

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

Qi Cheng (Univ. Oklahoma)

Feistel Schemes and Bi-linear Cryptanalysis,

Nicolas T. Courtois (Axalto Smart Cards)

Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks,

Ivan Damgaard, (BRICS, Univ. Aarhus), Serge Fehr (ACAC, Macquarie Univ.) Louis Salvail (BRICS, Univ. Aarhus)

Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography,

Masayuki Abe (NTT Laboratories, Japan), Serge Fehr (ACAC, Macquarie Univ.)

Efficient Tree-Based Revocation in Groups of Low-State Devices,

Michael T. Goodrich and Jonathan Z. Sun (U. C. Irvine), Roberto Tamassia (Brown Univ.)

Rewriting Variables: the Complexity of Fast Algebraic Attacks on Stream Ciphers,

Philip Hawkes and Gregory G. Rose (Qualcomm International, Australia)

Complete Classification of Bilinear Hard-Core Functions,

Thomas Holenstein and Johan Sjoedin and Ueli Maurer (ETH, Zurich)

Multicollisions in iterated hash functions. Application to cascaded constructions,

Antoine Joux (DCSSI Crypto Lab, PARIS)

Passive Timestamping in the Bounded Storage Model,

Tal Moran (Tel-Aviv Univ.), Ronen Shaltiel (Weizmann), Amnon Ta-Shma (Tel-Aviv Univ.)

Signed Binary Representations Revisited,

Katsuyuki Okeya (Hitachi), Katja Schmidt-Samoa and Christian Spahn and Tsuyoshi Takagi (TU Darmstadt, Germany)

Two Round-Optimal Zero-Knowledge Arguments in the Public-Key Model,

Giovanni Di Crescenzo (Telcordia, USA), Giuseppe Persiano (Univ. Salerno), Ivan Visconti (Ecole Normale Superieure)

IPAKE: Isomorphisms for Password-based Authenticated Key Exchange,

Dario Catalano and David Pointcheval (CNRS-ENS, France), Thomas Pornin (Cryptolog, France)

Finding Collisions on a Public Road, or Do Secure Hash Fuctions Need Secret Coins?,

Chun-Yuan Hsiao and Leonid Reyzin, (Boston Univ.)

Short Group Signatures,

Dan Boneh (Stanford Univ.), Xavier Boyen (Voltage Security), Hovav Shacham (Stanford Univ.)

Optimal Perfectly Secure Message Transmission,

K. Srinathan and Arvind Narayanan and C. Pandu Ranga (Indian Institute of Technology Madras)

Faster Correlation Attack on Bluetooth E0 Keystream Generator,

Yi Lu and Serge Vaudenay (EPFL)

Pseudo-signatures, broadcast, and multi-party computation from correlated randomness,

Matthias Fitzi (U. C. Davis), Stefan Wolf and Juerg Wullschleger (Univ. Montreal)

Asymptotically Optimal Communication for Torus-Based Cryptography,

Marten van Dijk (MIT / Philips Research), David Woodruff (MIT)

Secure Identity Based Encryption Without Random Oracles,

Dan Boneh (Stanford Univ.), Xavier Boyen (Voltage Security)

The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols,

Mihir Bellare and Adriana Palacio (U. C. San Diego)

A New Paradigm of Hybrid Encryption Scheme,

Kaoru Kurosawa (Ibaraki Univ.), Yvo Desmedt (Florida State Univ.)

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

Alexander May (Paderborn Univ.)

Round-Optimal Secure Two-Party Computation,

Jonathan Katz (Univ. Maryland), Rafail Ostrovsky (UCLA)

Near-Collisions of SHA-0,

Eli Biham and Rafi Chen (Technion)

An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators,

Håvard Molland and Tor Helleseth (Univ. Bergen)

How to Compress Rabin Ciphertexts and Signatures (and More),

Craig Gentry (DoCoMo USA Labs)

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

Rosario Gennaro (IBM T.J.Watson Research Center)

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes,

Rosario Gennaro (IBM T.J.Watson Research Center), Johan Hastad (Royal Institute of Technology), Hugo Krawczyk (Technion & IBM T.J.Watson Research Center) Tal Rabin (IBM T.J.Watson Research Center)

Privacy-Preserving Datamining on Vertically Partitioned Databases

Cynthia Dwork and Kobbi Nissim ( Microsoft Research).

Security of Random Feistel Schemes with 5 or more rounds

Jacques Patarin (Univ. Versailles)

Back to Main