EUROCRPYT 2003

WARSAW, POLAND

E. Biham (Ed.): Advances in Cryptology - EUROCRPYT 2003: International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003. Proceedings. Lecture Notes in Computer Science, Vol. 2656, 2003, Springer, ISBN 3-540-14039-5

Read the paper abstracts. More »

Cryptanalysis I

• Antoine Joux: Cryptanalysis of the EMD Mode of Operation p. 1
• Pascal Junod: On the Optimality of Linear, Differential, and Sequential Distinguishers p. 17
• Alex Biryukov, Christophe De Canni`ere, An Braeken,Bart Preneel: A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms p. 33

Secure Multi-party Computation I

• Matthias Fitzi, Martin Hirt, Thomas Holenstein, J¨urg Wullschleger: Two-Threshold Broadcast and Detectable Multi-party Computation p. 51
• Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions p. 68
• Benny Pinkas: Fair Secure Two-Party Computation p. 87

Invited Talk I

• Kris Gaj, Arkadiusz OrlowskiL Facts and Myths of Enigma: Breaking Stereotypes p. 106

Zero-Knowledge Protocols

• Yunlei Zhao, Xiaotie Deng, C.H. Lee, Hong Zhu: Resettable Zero-Knowledge in the Weak Public- Key Model p. 123
• Daniele Micciancio, Erez Petrank: Simulatable Commitments and Efficient Concurrent Zero- Knowledge p. 140
• Rafael Pass: Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition p. 160
• Juan A. Garay, Philip MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols Using Signatures p. 177

Foundations and Complexity Theoretic Security

• Gustav Hast: Nearly One-Sided Tests and the Goldreich-Levin Predicate p. 195
• Jonathan Katz: Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications p. 211

Public Key Encryption

• Daniel Augot, Matthieu Finiasz: A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem p. 229
• Yehuda Lindell: A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions p. 241
• Ran Canetti, Shai Halevi, Jonathan Katz: A Forward-Secure Public-Key Encryption Scheme p. 255
• Craig Gentry: Certificate-Based Encryption and the Certificate Revocation Problemp. 272

New Primitives

• Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford: CAPTCHA: Using Hard AI Problems for Securityp. 294
• Yevgeniy Dodis, Jee Hea An: Concealment and Its Applications to Authenticated Encryption p. 312

Cryptanalysis II

• Patrik Ekdahl, Willi Meier, Thomas Johansson: Predicting the Shrinking Generator with Fixed Connections p. 330
• Nicolas T. Courtois, Willi Meier: Algebraic Attacks on Stream Ciphers with Linear Feedback p. 345

Elliptic Curves Cryptography

• Reynald Lercier, David Lubicz: Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time p. 360
• Florian Hess: The GHS Attack Revisited p. 374
• Mathieu Ciet, Tanja Lange, Francesco Sica,Jean-Jacques Quisquater: Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms p. 388

Digital Signatures

• Eu-Jin Goh, Stanis_law Jarecki: A Signature Scheme as Secure as the Diffie-Hellman Problem p. 401
• Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps p. 416
• Michael Szydlo: Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures p. 433

Invited Talk II

• Jacques Stern: Why Provable Security Matters? p. 449

Cryptanalysis III

• Pierre-Alain Fouque, Guillaume Poupard: On the Security of RDSA p. 462
• Eonkyung Lee, Je Hong Park: Cryptanalysis of the Public-Key Encryption Based on Braid Groups p. 477
• Mihir Bellare, Tadayoshi Kohno: A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications p. 491

Key Exchange

• Mario Di Raimondo, Rosario Gennaro: Provably Secure Threshold Password-Authenticated Key Exchange p. 507
• Rosario Gennaro, Yehuda Lindell: A Framework for Password-Based Authenticated Key Exchange p. 524

Information Theoretic Cryptography

• Ueli Maurer, Krzysztof Pietrzak: The Security of Many-Round Luby-Rackoff: Pseudo-Random Permutations p. 544
• Renato Renner, Stefan Wolf: New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction p. 562

Secure Multi-party Computation II

• Jonathan Katz, Rafail Ostrovsky, Adam Smith: Round Efficiency of Multi-party Computation with a Dishonest Majority p. 578
• Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-party Computation over Rings p. 596

Group Signatures

• Mihir Bellare, Daniele Micciancio, Bogdan Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions p. 614
• Aggelos Kiayias, Moti Yung: Extracting Group Signatures from Traitor Tracing Schemes p. 630