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

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