Eurocrypt 2003 Papers

Cryptanalysis I

Cryptanalysis of the EMD Mode of Operation
Antoine Joux

On the Optimality of Linear, Differential and Sequential Distinguishers
Pascal Junod

A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms
Alex Biryukov, Christophe De Canniere, An Braeken, and Bart Preneel

Secure Multi-Party Computation I

Two-Threshold Broadcast and Detectable Multi-Party Computation
Matthias Fitzi, Martin Hirt, Thomas Holenstein, and Jurg Wullschleger

On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions
Ran Canetti, Eyal Kushilevitz, and Yehuda Lindell

Fair Secure Two-Party Computation
Benny Pinkas

Invited Talk I

Facts and Myths of Enigma: Breaking Stereotypes
Arkadiusz Orlowski and Kris Gaj

Zero-Knowledge Protocols

Resettable Zero-Knowledge in the Weak Public-Key Model
Yunlei Zhao, Xiaotie Deng, C. H. Lee, and Hong Zhu

Simulatable Commitments and Efficient Concurrent Zero-Knowledge
Daniele Micciancio and Erez Petrank

Simulation in Quasi-polynomial Time, and its Application to Protocol Composition
Rafael Pass

Strengthening Zero-Knowledge Protocols Using Signatures
Juan Garay, Phil MacKenzie, and Ke Yang

Foundations and Complexity Theoretic Security

Nearly One-Sided Tests and the Goldreich-Levin Predicate
Gustav Hast

Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications
Jonathan Katz

Public Key Encryption

A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
Daniel Augot and Matthieu Finiasz

A Simpler Construction of CCA2-Secure Public-Key Encryption Under General Assumptions
Yehuda Lindell

A Forward-Secure Public-Key Encryption Scheme
Ran Canetti, Shai Halevi, and Jonathan Katz

Certificate-Based Encryption and the Certificate Revocation Problem
Craig Gentry

New Primitives

CAPTCHA: Using Hard AI Problems For Security
Luis von Ahn, Manuel Blum, Nicholas Hopper, and John Langford

Concealment and its Applications to Authenticated Encryption
Yevgeniy Dodis and Jee Hea An

Cryptanalysis II

Predicting the Shrinking Generator with Fixed Connections
Patrik Ekdahl, Willi Meier, and Thomas Johansson

Algebraic Attacks on Stream Ciphers with Linear Feedback
Nicolas T. Courtois and Willi Meier

Elliptic Curves Cryptography

Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time
Reynald Lercier and David Lubicz

The GHS Attack Revisited
Florian Hess

Improved Algorithms for Efficient Arithmetic on Elliptic Curve Using Fast Endomorphisms
Mathieu Ciet, Tanja Lange, Francesco Sica, and Jean-Jacques Quisquater

Digital Signatures

A Signature Scheme as Secure as the Diffie-Hellman Problem
Eu-Jin Goh and Stanislaw Jarecki

Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham

Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
Michael Szydlo

Invited Talk II

Why Provable Security Matters?
Jacques Stern

Cryptanalysis III

On the Security of RDSA
Pierre-Alain Fouque and Guillaume Poupard

Cryptanalysis of the Public-Key Encryption Based on Braid Groups
Eonkyung Lee and Je Hong Park

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

Key Exchange

Provably Secure Threshold Password-Authenticated Key Exchange
Mario Di Raimondo and Rosario Gennaro

A Framework for Password-Based Authenticated Key Exchange
Rosario Gennaro and Yehuda Lindell

Information Theoretic Cryptography

The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
Ueli Maurer and Krzysztof Pietrzak

New Bounds in Secret-Key Agreement: The Gap Between Formation and Secrecy Extraction
Renato Renner and Stefan Wolf

Secure Multi-Party Computation II

Round Efficiency of Multi-Party Computation with a Dishonest Majority
Jonathan Katz, Rafail Ostrovsky, and Adam Smith

Efficient Multi-Party Computation over Rings
Ronald Cramer, Serge Fehr, Yuval Ishai, and Eyal Kushilevitz

Group Signatures

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

Extracting Group Signatures from Traitor Tracing Schemes
Aggelos Kiayias and Moti Yung