CRYPTO 2004

Santa Barbara, California, USA

Matt Franklin (Ed.): Advances in Cryptology – CRYPTO ‘04:24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 2004. Proceedings. Lecture Notes in Computer Science Volume 3152, Springer, 2004, ISBN 3-540-22668-0

Read the paper abstracts. More »

Linear Cryptanalysis

• Alex Biryukov, Christophe De Canni`ere, and Micha¨el Quisquater: On Multiple Linear Approximations p. 1
• Nicolas T. Courtois: Feistel Schemes and Bi-linear Cryptanalysis p. 23

Group Signatures

• Dan Boneh, Xavier Boyen, and Hovav Shacham: Short Group Signatures p. 41
• Jan Camenisch and Anna Lysyanskaya: Signature Schemes and Anonymous Credentials from Bilinear Maps p. 56

Foundations

• Thomas Holenstein, Ueli Maurer, and Johan Sj¨odin: Complete Classification of Bilinear Hard-Core Functions p. 73
• Chun-Yuan Hsiao and Leonid Reyzin: Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? p. 92
• Jacques Patarin: Security of Random Feistel Schemes with 5 or More Rounds p. 106

Efficient Representations

• Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, and Tsuyoshi Takagi: Signed Binary Representations Revisited p. 123
• Michael Scott and Paulo S.L.M. Barreto: Compressed Pairings p. 140
• Marten van Dijk and David Woodruf: Asymptotically Optimal Communication for Torus-Based Cryptography p. 157
• Craig Gentry: How to Compress Rabin Ciphertexts and Signatures (and More) p. 179

Public Key Cryptanalysis

• Qi Cheng: On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields p. 201
• Alexander May: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring p. 213

Zero-Knowledge

• Rosario Gennaro: Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks p. 220
• Giovanni Di Crescenzo, Giuseppe Persiano, and Ivan Visconti: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model p. 237
• Ivan Damg°ard, Serge Fehr, and Louis Salvail: Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks p. 254
• Mihir Bellare and Adriana Palacio: The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocolsp. 273

Hash Collisions

• Eli Biham and Rafi Chen: Near-Collisions of SHA-0 p. 290
• Antoine Joux: Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions p. 306

Secure Computation

• Masayuki Abe and Serge Fehr: Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography p. 317
• Jonathan Katz and Rafail Ostrovsky: Round-Optimal Secure Two-Party Computation p. 335

Invited Talk

• Susan Landau: Security, Liberty, and Electronic Communications p. 355

Stream Cipher Cryptanalysis

• H°avard Molland and Tor Helleseth: An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators p. 373
• Philip Hawkes and Gregory G. Rose: Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers p. 390
• Yi Lu and Serge Vaudenay: Faster Correlation Attack on Bluetooth Keystream Generator E0 p. 407

Public Key Encryption

• Kaoru Kurosawa and Yvo Desmedt: A New Paradigm of Hybrid Encryption Scheme p. 426
• Dan Boneh and Xavier Boyen: Secure Identity Based Encryption Without Random Oracles p. 443

Bounded Storage Model

• Tal Moran, Ronen Shaltiel, and Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model p. 460

Key Management

• Dario Catalano, David Pointcheval, and Thomas Pornin: IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange p. 477
• Yevgeniy Dodis, Rosario Gennaro, Johan H°astad, Hugo Krawczyk, and Tal Rabin: Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes p. 494
• Michael T. Goodrich, Jonathan Z. Sun, and Roberto Tamassia: Efficient Tree-Based Revocation in Groups of Low-State Devices p. 511

Computationally Unbounded Adversaries

• Cynthia Dwork and Kobbi Nissim: Privacy-Preserving Datamining on Vertically Partitioned Databases p. 528
• K. Srinathan, Arvind Narayanan, and C. Pandu Rangan: Optimal Perfectly Secure Message Transmission p. 545
• Matthias Fitzi, Stefan Wolf, and J¨urg Wullschleger: Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness p. 562