IACR Archive     By conference     Most prolific     All committees     Most committees     Report errors     What's new

Proceedings of CRYPTO 2003

Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings , Springer
Factoring Large Number with the TWIRL Device., Adi Shamir, Eran Tromer, pp. 1-26
 PDF  postscript BibTeX
New Partial Key Exposure Attacks on RSA., Johannes Blömer, Alexander May, pp. 27-43
 PDF  postscript BibTeX
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases., Jean-Charles Faugère, Antoine Joux, pp. 44-60
 PDF  postscript BibTeX
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model., Salil P. Vadhan, pp. 61-77
 PDF  postscript BibTeX
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret., Renato Renner, Stefan Wolf, pp. 78-95
 PDF  postscript BibTeX
On Cryptographic Assumptions and Challenges., Moni Naor, pp. 96-109
 PDF  postscript BibTeX
Scalable Protocols for Authenticated Group Key Exchange., Jonathan Katz, Moti Yung, pp. 110-125
 PDF  postscript BibTeX
Practical Verifiable Encryption and Decryption of Discrete Logarithms., Jan Camenisch, Victor Shoup, pp. 126-144
 PDF  postscript BibTeX
Extending Oblivious Transfers Efficiently., Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank, pp. 145-161
 PDF  postscript BibTeX
Algebraic Attacks on Combiners with Memory., Frederik Armknecht, Matthias Krause, pp. 162-175
 PDF  postscript BibTeX
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback., Nicolas Courtois, pp. 176-194
 PDF  postscript BibTeX
Cryptanalysis of SAFER++., Alex Biryukov, Christophe De Cannière, Gustaf Dellkrantz, pp. 195-211
 PDF  postscript BibTeX
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem., Jung Hee Cheon, Byungheup Jun, pp. 212-225
 PDF  postscript BibTeX
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, William Whyte, pp. 226-246
 PDF  postscript BibTeX
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption., Ivan Damgård, Jesper Buus Nielsen, pp. 247-264
 PDF  postscript BibTeX
Universal Composition with Joint State., Ran Canetti, Tal Rabin, pp. 265-281
 PDF  postscript BibTeX
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More., Daniele Micciancio, Salil P. Vadhan, pp. 282-298
 PDF  postscript BibTeX
Derandomization in Cryptography., Boaz Barak, Shien Jin Ong, Salil P. Vadhan, pp. 299-315
 PDF  postscript BibTeX
On Deniability in the Common Reference String and Random Oracle Model., Rafael Pass, pp. 316-337
 PDF  postscript BibTeX
Primality Proving via One Round in ECPP and One Iteration in AKS., Qi Cheng, pp. 338-348
 PDF  postscript BibTeX
Torus-Based Cryptography., Karl Rubin, Alice Silverberg, pp. 349-365
 PDF  postscript BibTeX
Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation., Yuichi Komano, Kazuo Ohta, pp. 366-382
 PDF  postscript BibTeX
Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography)., Xavier Boyen, pp. 383-399
 PDF  postscript BibTeX
SIGMA: The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols., Hugo Krawczyk, pp. 400-425
 PDF  postscript BibTeX
On Memory-Bound Functions for Fighting Spam., Cynthia Dwork, Andrew Goldberg, Moni Naor, pp. 426-444
 PDF  postscript BibTeX
Lower and Upper Bounds on Obtaining History Independence., Niv Buchbinder, Erez Petrank, pp. 445-462
 PDF  postscript BibTeX
Private Circuits: Securing Hardware against Probing Attacks., Yuval Ishai, Amit Sahai, David Wagner, pp. 463-481
 PDF  postscript BibTeX
A Tweakable Enciphering Mode., Shai Halevi, Phillip Rogaway, pp. 482-499
 PDF  postscript BibTeX
A Message Authentication Code Based on Unimodular Matrix Groups., Matthew Cary, Ramarathnam Venkatesan, pp. 500-512
 PDF  postscript BibTeX
Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security., Jacques Patarin, pp. 513-529
 BibTeX
Weak Key Authenticity and the Computational Completeness of Formal Encryption., Omer Horvitz, Virgil D. Gligor, pp. 530-547
 PDF  postscript BibTeX
Plaintext Awareness via Key Registration., Jonathan Herzog, Moses Liskov, Silvio Micali, pp. 548-564
 PDF  postscript BibTeX
Relaxing Chosen-Ciphertext Security., Ran Canetti, Hugo Krawczyk, Jesper Buus Nielsen, pp. 565-582
 PDF  postscript BibTeX
Password Interception in a SSL/TLS Channel., Brice Canvel, Alain P. Hiltgen, Serge Vaudenay, Martin Vuagnoux, pp. 583-599
 PDF  postscript BibTeX
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication., Elad Barkan, Eli Biham, Nathan Keller, pp. 600-616
 PDF  postscript BibTeX
Making a Faster Cryptanalytic Time-Memory Trade-Off., Philippe Oechslin, pp. 617-630
 PDF  postscript BibTeX

[ IACR home page ] © IACR