Advances in Cryptology -- CRYPTO 2003

1. Front Matter

   PDF

2. Public Key Cryptanalysis I

   1. Factoring Large Numbers with the TWIRL Device

      • Adi Shamir, Eran Tromer

      Pages 1-26

   2. New Partial Key Exposure Attacks on RSA

      • Johannes Blömer, Alexander May

      Pages 27-43

   3. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases

      • Jean-Charles Faugère, Antoine Joux

      Pages 44-60

3. Alternate Adversary Models

   1. On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model

      • Salil P. Vadhan

      Pages 61-77

   2. Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret

      • Renato Renner, Stefan Wolf

      Pages 78-95

4. Invited Talk I

   1. On Cryptographic Assumptions and Challenges

      • Moni Naor

      Pages 96-109

5. Protocols

   1. Scalable Protocols for Authenticated Group Key Exchange

      • Jonathan Katz, Moti Yung

      Pages 110-125

   2. Practical Verifiable Encryption and Decryption of Discrete Logarithms

      • Jan Camenisch, Victor Shoup

      Pages 126-144

   3. Extending Oblivious Transfers Efficiently

      • Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank

      Pages 145-161

6. Symmetric Key Cryptanalysis I

   1. Algebraic Attacks on Combiners with Memory

      • Frederik Armknecht, Matthias Krause

      Pages 162-175

   2. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback

      • Nicolas T. Courtois

      Pages 176-194

   3. Cryptanalysis of Safer++

      • Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz

      Pages 195-211

7. Public Key Cryptanalysis II

   1. A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem

      • Jung Hee Cheon, Byungheup Jun

      Pages 212-225

   2. The Impact of Decryption Failures on the Security of NTRU Encryption

      • Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer et al.

      Pages 226-246

8. Universal Composability

   1. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption

      • Ivan Damgård, Jesper Buus Nielsen

      Pages 247-264

   2. Universal Composition with Joint State

      • Ran Canetti, Tal Rabin

      Pages 265-281

9. Zero-Knowledge

   1. Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More

      • Daniele Micciancio, Salil P. Vadhan

      Pages 282-298

   2. Derandomization in Cryptography

      • Boaz Barak, Shien Jin Ong, Salil Vadhan

      Pages 299-315

   3. On Deniability in the Common Reference String and Random Oracle Model

      • Rafael Pass

      Pages 316-337

Crypto 2003, the 23rd 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 conference received 169 submissions, of which the program committee selected 34 for presentation. These proceedings contain the revised versions of the 34 submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. Submissions to the conference represent cutti- edge research in the cryptographic community worldwide and cover all areas of cryptography. Many high-quality works could not be accepted. These works will surely be published elsewhere. The conference program included two invited lectures. Moni Naor spoke on cryptographic assumptions and challenges. Hugo Krawczyk spoke on the ‘SI- and-MAc’approachtoauthenticatedDi?e-HellmananditsuseintheIKEpro- cols. The conference program also included the traditional rump session, chaired by Stuart Haber, featuring short, informal talks on late-breaking research news. Assembling the conference program requires the help of many many people. To all those who pitched in, I am forever in your debt. I would like to ?rst thank the many researchers from all over the world who submitted their work to this conference. Without them, Crypto could not exist. I thank Greg Rose, the general chair, for shielding me from innumerable logistical headaches, and showing great generosity in supporting my e?orts.

• Message Authentication Code
• Padding
• Signcryption
• Zero Knowledge
• algebraic geometry
• authentication
• authenticity
• computational number theory
• cryptographic protocols
• cryptography
• cryptology
• information security
• multiparty computation
• public key cryptography
• symmetric cryptography
• algorithm analysis and problem complexity

• Computer Science Dept., Stanford University,  

  Dan Boneh

Policies and ethics