24. CRYPTO 2004: Santa Barbara, California, USA

Linear Cryptanalysis

• Alex Biryukov, Christophe De Cannière, Michaël Quisquater:
  On Multiple Linear Approximations. 1-22
  
• Nicolas Courtois:
  Feistel Schemes and Bi-linear Cryptanalysis. 23-40
  

Group Signatures

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

Foundations

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

Efficient Representations

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

Public Key Cryptanalysis

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

Zero-Knowledge

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

Hash Collisions

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

Secure Computation

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

Invited Talk

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

Stream Cipher Cryptanalysis

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

Public Key Encryption

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

Bounded Storage Model

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

Key Management

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

Computationally Unbounded Adversaries

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