International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4-8, 2003, Proceedings

Preface and frontmatter

Page	Title
1-16	Cryptanalysis of the EMD Mode of Operation
17-32	On the Optimality of Linear, Differential, and Sequential Distinguishers
33-50	A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms
51-67	Two-Threshold Broadcast and Detectable Multi-party Computation
68-86	On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
87-105	Fair Secure Two-Party Computation
106-122	Facts and Myths of Enigma: Breaking Stereotypes
123-139	Resettable Zero-Knowledge in the Weak Public-Key Model
140-159	Simulatable Commitments and Efficient Concurrent Zero-Knowledge
160-176	Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition
177-194	Strengthening Zero-Knowledge Protocols Using Signatures
195-210	Nearly One-Sided Tests and the Goldreich-Levin Predicate
211-228	Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications
229-240	A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
241-254	A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions
255-271	A Forward-Secure Public-Key Encryption Scheme
272-293	Certificate-Based Encryption and the Certificate Revocation Problem
294-311	CAPTCHA: Using Hard AI Problems for Security
312-329	Concealment and Its Applications to Authenticated Encryption
330-344	Predicting the Shrinking Generator with Fixed Connections
345-359	Algebraic Attacks on Stream Ciphers with Linear Feedback
360-373	Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time
374-387	The GHS Attack Revisited
388-400	Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms
401-415	A Signature Scheme as Secure as the Diffie-Hellman Problem
416-432	Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
433-448	Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
449-461	Why Provable Security Matters?
462-476	On the Security of RDSA
477-490	Cryptanalysis of the Public-Key Encryption Based on Braid Groups
491-506	A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
507-523	Provably Secure Threshold Password-Authenticated Key Exchange
524-543	A Framework for Password-Based Authenticated Key Exchange
544-561	The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
562-577	New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
578-595	Round Efficiency of Multi-party Computation with a Dishonest Majority
596-613	Efficient Multi-party Computation over Rings
614-629	Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions
630-648	Extracting Group Signatures from Traitor Tracing Schemes