Proceedings of EUROCRYPT 2003

Cryptanalysis of the EMD Mode of Operation., Antoine Joux, pp. 1-16

 PDF  postscript BibTeX

On the Optimality of Linear, Differential, and Sequential Distinguishers., Pascal Junod, pp. 17-32

 PDF  postscript BibTeX

A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms., Alex Biryukov, Christophe De Cannière, An Braeken, Bart Preneel, pp. 33-50

 PDF  postscript BibTeX

Two-Threshold Broadcast and Detectable Multi-party Computation., Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger, pp. 51-67

 PDF  postscript BibTeX

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions., Ran Canetti, Eyal Kushilevitz, Yehuda Lindell, pp. 68-86

 PDF  postscript BibTeX

Fair Secure Two-Party Computation., Benny Pinkas, pp. 87-105

 PDF  postscript BibTeX

Facts and Myths of Enigma: Breaking Stereotypes., Kris Gaj, Arkadiusz Orlowski, pp. 106-122

 Microsoft Word BibTeX

Resettable Zero-Knowledge in the Weak Public-Key Model., Yunlei Zhao, Xiaotie Deng, Chan H. Lee, Hong Zhu, pp. 123-139

 PDF  postscript BibTeX

Simulatable Commitments and Efficient Concurrent Zero-Knowledge., Daniele Micciancio, Erez Petrank, pp. 140-159

 PDF  postscript BibTeX

Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition., Rafael Pass, pp. 160-176

 PDF  postscript BibTeX

Strengthening Zero-Knowledge Protocols Using Signatures., Juan A. Garay, Philip D. MacKenzie, Ke Yang, pp. 177-194

 PDF  postscript BibTeX

Nearly One-Sided Tests and the Goldreich-Levin Predicate., Gustav Hast, pp. 195-210

 PDF  postscript BibTeX

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications., Jonathan Katz, pp. 211-228

 PDF  postscript BibTeX

A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem., Daniel Augot, Matthieu Finiasz, pp. 229-240

 PDF  postscript BibTeX

A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions., Yehuda Lindell, pp. 241-254

 PDF  postscript BibTeX

A Forward-Secure Public-Key Encryption Scheme., Ran Canetti, Shai Halevi, Jonathan Katz, pp. 255-271

 PDF  postscript BibTeX

Certificate-Based Encryption and the Certificate Revocation Problem., Craig Gentry, pp. 272-293

 PDF  postscript BibTeX

CAPTCHA: Using Hard AI Problems for Security., Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford, pp. 294-311

 PDF  postscript BibTeX

Concealment and Its Applications to Authenticated Encryption., Yevgeniy Dodis, Jee Hea An, pp. 312-329

 PDF  postscript BibTeX

Predicting the Shrinking Generator with Fixed Connections., Patrik Ekdahl, Willi Meier, Thomas Johansson, pp. 330-344

 PDF  postscript BibTeX

Algebraic Attacks on Stream Ciphers with Linear Feedback., Nicolas Courtois, Willi Meier, pp. 345-359

 PDF  postscript BibTeX

Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time., Reynald Lercier, David Lubicz, pp. 360-373

 PDF  postscript BibTeX

The GHS Attack Revisited., Florian Hess, pp. 374-387

 PDF  postscript BibTeX

Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms., Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Jacques Quisquater, pp. 388-400

 PDF  postscript BibTeX

A Signature Scheme as Secure as the Diffie-Hellman Problem., Eu-Jin Goh, Stanislaw Jarecki, pp. 401-415

 PDF  postscript BibTeX

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps., Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham, pp. 416-432

 PDF  postscript BibTeX

Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures., Michael Szydlo, pp. 433-448

 PDF  postscript BibTeX

Why Provable Security Matters?, Jacques Stern, pp. 449-461

 PDF  postscript BibTeX

On the Security of RDSA., Pierre-Alain Fouque, Guillaume Poupard, pp. 462-476

 PDF  postscript BibTeX

Cryptanalysis of the Public-Key Encryption Based on Braid Groups., Eonkyung Lee, Je Hong Park, pp. 477-490

 PDF  postscript BibTeX

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications., Mihir Bellare, Tadayoshi Kohno, pp. 491-506

 PDF  postscript BibTeX

Provably Secure Threshold Password-Authenticated Key Exchange., Mario Di Raimondo, Rosario Gennaro, pp. 507-523

 PDF  postscript BibTeX

A Framework for Password-Based Authenticated Key Exchange., Rosario Gennaro, Yehuda Lindell, pp. 524-543

 PDF  postscript BibTeX

The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations., Ueli M. Maurer, Krzysztof Pietrzak, pp. 544-561

 PDF  postscript BibTeX

New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction., Renato Renner, Stefan Wolf, pp. 562-577

 PDF  postscript BibTeX

Round Efficiency of Multi-party Computation with a Dishonest Majority., Jonathan Katz, Rafail Ostrovsky, Adam Smith, pp. 578-595

 PDF  postscript BibTeX

Efficient Multi-party Computation over Rings., Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz, pp. 596-613

 PDF  postscript BibTeX

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions., Mihir Bellare, Daniele Micciancio, Bogdan Warinschi, pp. 614-629

 BibTeX

Extracting Group Signatures from Traitor Tracing Schemes., Aggelos Kiayias, Moti Yung, pp. 630-648

 BibTeX