CRYPTO 2003

Santa Barbara, California, USA

D. Boneh (Ed.): Advances in Cryptology - CRYPTO '03: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings. Lecture Notes in Computer Science Volume 2729, Springer, 2003, ISBN: 3-540-40674-3

Read the paper abstracts. More »

Public Key Cryptanalysis I

• Adi Shamir and Eran Tromer: Factoring Large Numbers with the TWIRL Device p. 1
• Johannes Blömer and Alexander May: New Partial Key Exposure Attacks on RSA p. 27
• Jean-Charles Faugère and Antoine Joux: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases p. 44

Alternate Adversary models

• Salil P. Vadhan: On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model p. 61
• Renato Renner and Stefan Wolf: Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret p. 78

Invited Talk I

• Moni Naor: On Cryptographic Assumptions and Challenges p. 96

Protocols

• Jonathan Katz and Moti Yung: Scalable Protocols for Authenticated Group Key Exchange p. 110
• Jan Camenisch and Victor Shoup: Practical Verifiable Encryption and Decryption of Discrete Logarithms p. 126
• Yuval Ishai, Joe Kilian, Kobbi Nissim, et al.: Extending Oblivious Transfers Efficiently p. 145

Symmetric Key Cryptanalysis I

• Frederik Armknecht and Matthias Krause: Algebraic Attacks on Combiners with Memory p. 162
• Nicolas T. Courtois: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback p. 176
• Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz: Cryptanalysis of Safer++ p. 195

Public Key cryptanalysis II

• Jung Hee Cheon and Byungheup Jun: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem p. 212
• Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, et al.: The Impact of Decryption Failures on the Security of NTRU Encryption p. 226

Universal Composability

• Ivan Damgård and Jesper Buus Nielsen: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption p. 247
• Ran Canetti and Tal Rabin: Universal Composition with Joint State p. 265

Zero-Knowledge

• Daniele Micciancio and Salil P. Vadhan: Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More p. 282
• Boaz Barak, Shien Jin Ong, Salil Vadhan: Derandomization in Cryptography p. 299
• Rafael Pass: On Deniability in the Common Reference String and Random Oracle Model p. 316

Algebraic Geometry

• Qi Cheng: Primality Proving via One Round in ECPP and One Iteration in AKS p. 338
• Karl Rubin and Alice Silverberg: Torus-Based Cryptography p. 349

Public Key Constructions

• Yuichi Komano and Kazuo Ohta: Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation p. 366
• Xavier Boyen: Multipurpose Identity-Based Signcryption: A Swiss Army Knife for Identity-Based Cryptography p. 383

Invited Talk II

• Hugo Krawczyk: SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols p. 400

New Problems

• Cynthia Dwork, Andrew Goldberg, Moni Naor: On Memory-Bound Functions for Fighting Spam p. 426
• Niv Buchbinder and Erez Petrank: Lower and Upper Bounds on Obtaining History Independence p. 445
• Yuval Ishai, Amit Sahai, David Wagner: Private Circuits: Securing Hardware against Probing Attacks p. 463

Symmetric key constructions

• Shai Halevi and Phillip Rogaway: A Tweakable Enciphering Mode p. 482
• Matthew Cary and Ramarathnam Venkatesan: A Message Authentication Code Based on Unimodular Matrix Groups p. 500
• Jacques Patarin: Luby-Rackoff: 7 Rounds Are Enough for Security p. 513

New Models

• Omer Horvitz and Virgil Gligor: Weak Key Authenticity and the Computational Completeness of Formal Encryption p. 530
• Jonathan Herzog, Moses Liskov, Silvio Micali: Plaintext Awareness via Key Registration p. 548
• Ran Canetti, Hugo Krawczyk, Jesper B. Nielsen: Relaxing Chosen-Ciphertext Security p. 565

Symmetric key Cryptanalysis II

• Brice Canvel, Alain Hiltgen, Serge Vaudenay, et al.: Password Interception in a SSL/TLS Channel p. 583
• Elad Barkan, Eli Biham, Nathan Keller: Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication p. 600
• Philippe Oechslin: Making a Faster Cryptanalytic Time-Memory Trade-Off p. 617