Advances in Cryptology - CRYPTO 2004

1. Front Matter

   PDF

2. Linear Cryptanalysis

   1. On Multiple Linear Approximations

      • Alex Biryukov, Christophe De Cannière, Michaël Quisquater

      Pages 1-22

   2. Feistel Schemes and Bi-linear Cryptanalysis

      • Nicolas T. Courtois

      Pages 23-40

3. Group Signatures

   1. Short Group Signatures

      • Dan Boneh, Xavier Boyen, Hovav Shacham

      Pages 41-55

   2. Signature Schemes and Anonymous Credentials from Bilinear Maps

      • Jan Camenisch, Anna Lysyanskaya

      Pages 56-72

4. Foundations

   1. Complete Classification of Bilinear Hard-Core Functions

      • Thomas Holenstein, Ueli Maurer, Johan Sjödin

      Pages 73-91

   2. Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?

      • Chun-Yuan Hsiao, Leonid Reyzin

      Pages 92-105

   3. Security of Random Feistel Schemes with 5 or More Rounds

      • Jacques Patarin

      Pages 106-122

5. Efficient Representations

   1. Signed Binary Representations Revisited

      • Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi

      Pages 123-139

   2. Compressed Pairings

      • Michael Scott, Paulo S. L. M. Barreto

      Pages 140-156

   3. Asymptotically Optimal Communication for Torus-Based Cryptography

      • Marten van Dijk, David Woodruff

      Pages 157-178

   4. How to Compress Rabin Ciphertexts and Signatures (and More)

      • Craig Gentry

      Pages 179-200

6. Public Key Cryptanalysis

   1. On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields

      • Qi Cheng

      Pages 201-212

   2. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring

      • Alexander May

      Pages 213-219

7. Zero-Knowledge

   1. Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks

      • Rosario Gennaro

      Pages 220-236

   2. Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model

      • Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti

      Pages 237-253

   3. Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks

      • Ivan Damgård, Serge Fehr, Louis Salvail

      Pages 254-272

   4. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols

      • Mihir Bellare, Adriana Palacio

      Pages 273-289

8. Hash Collisions

   1. Near-Collisions of SHA-0

      • Eli Biham, Rafi Chen

      Pages 290-305

   2. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions

      • Antoine Joux

      Pages 306-316

Crypto 2004, the 24th Annual Crypto Conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. The program committee accepted 33 papers for presentation at the conf- ence. These were selected from a total of 211 submissions. Each paper received at least three independent reviews. The selection process included a Web-based discussion phase, and a one-day program committee meeting at New York U- versity. These proceedings include updated versions of the 33 accepted papers. The authors had a few weeks to revise them, aided by comments from the reviewers. However, the revisions were not subjected to any editorial review. Theconferenceprogramincludedtwoinvitedlectures.VictorShoup’sinvited talk was a survey on chosen ciphertext security in public-key encryption. Susan Landau’s invited talk was entitled “Security, Liberty, and Electronic Commu- cations”. Her extended abstract is included in these proceedings. We continued the tradition of a Rump Session, chaired by Stuart Haber. Those presentations (always short, often serious) are not included here.

• Bluetooth
• Oracle
• RSA
• Variable
• cryptanalysis
• cryptographic protocols
• cryptography
• cryptology
• cryptosystems
• data encryption
• database
• finite field
• privacy
• public key cryptography
• security
• algorithm analysis and problem complexity

• Department of Computer Science, University of California, Davis, USA

  Matt Franklin

Policies and ethics