23. CRYPTO 2003: Santa Barbara, California, USA

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

Public Key Cryptanalysis I

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

Alternate Adversary Models

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

Invited Talk I

Moni Naor:
On Cryptographic Assumptions and Challenges. 96-109

Protocols

Jonathan Katz, Moti Yung:
Scalable Protocols for Authenticated Group Key Exchange. 110-125
Jan Camenisch, Victor Shoup:
Practical Verifiable Encryption and Decryption of Discrete Logarithms. 126-144
Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank:
Extending Oblivious Transfers Efficiently. 145-161

Symmetric Key Cryptanalysis I

Frederik Armknecht, Matthias Krause:
Algebraic Attacks on Combiners with Memory. 162-175
Nicolas Courtois:
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. 176-194
Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz:
Cryptanalysis of SAFER++. 195-211

Public Key Cryptanalysis II

Jung Hee Cheon, Byungheup Jun:
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem. 212-225
Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte:
The Impact of Decryption Failures on the Security of NTRU Encryption. 226-246

Universal Composability

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

Zero-Knowledge

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

Algebraic Geometry

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

Public Key Constructions

Yuichi Komano, Kazuo Ohta:
Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation. 366-382
Xavier Boyen:
Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography). 383-399

Invited Talk II

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

New Problems

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

Symmetric Key Constructions

Shai Halevi, Phillip Rogaway:
A Tweakable Enciphering Mode. 482-499
Matthew Cary, Ramarathnam Venkatesan:
A Message Authentication Code Based on Unimodular Matrix Groups. 500-512
Jacques Patarin:
Luby-Rackoff: 7 Rounds Are Enough for 2^n(1-epsilon)Security. 513-529

New Models

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

Symmetric Key Cryptanalysis II

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

Last update Wed May 22 23:07:30 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page