EUROCRYPT 2000

BRUGES, BELGIUM

B. Preneel (Ed.): Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 2000. Proceedings. Lecture Notes in Computer Science, Vol. 1807, Springer, 2000, ISBN 3-540-67517-5

Read the paper abstracts. More »

Factoring and Discrete Logarithm

• Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, et al.: Factorization of a 512-Bit RSA Modulus p. 1
• Pierrick Gaudry: An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves p. 19
• Arjen K. Lenstra and Adi Shamir: Analysis and Optimization of the TWINKLE Factoring Device p. 35

Cryptanalysis I: Digital Signatures

• Daniel Bleichenbacher and Phong Q. Nguyen: Noisy Polynomial Interpolation and Noisy Chinese Remaindering p. 53
• François Grieu: A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme p. 70
• Marc Girault and Jean-François Misarsky: Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1 p. 81
• Jean-Sébastien Coron and David Naccache: Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme p. 91

Invited Talk

• Michael Walker: On the Security of 3GPP Networks p. 102

Private Information Retrieval

• Eyal Kushilevitz and Rafail Ostrovsky: One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval p. 104
• Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky: Single Database Private Information Retrieval Implies Oblivious Transfer p. 122

Key Management Protocols

• Mihir Bellare, David Pointcheval, Phillip Rogaway: Authenticated Key Exchange Secure against Dictionary Attacks p. 139
• Victor Boyko, Philip MacKenzie, Sarvar Patel: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman p. 156
• Guillaume Poupard and Jacques Stern: Fair Encryption of RSA Keys p. 172

Threshold Cryptography and Digital Signatures

• Dario Catalano, Rosario Gennaro, Shai Halevi: Computing Inverses over a Shared Secret Modulus p. 190
• Victor Shoup: Practical Threshold Signatures p. 207
• Stanislaw Jarecki and Anna Lysyanskaya: Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures (Extended Abstract) p. 221
• Jan Camenisch and Markus Michels: Confirmer Signature Schemes Secure against Adaptive Adversaries (Extended Abstract) p. 243

Public-Key Encryption

• Mihir Bellare, Alexandra Boldyreva, Silvio Micali: Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements p. 259
• Victor Shoup: Using Hash Functions as a Hedge against Chosen Ciphertext Attack p. 275

Quantum Cryptography

• Gilles Brassard, Norbert Lütkenhaus, Tal Mor, et al.: Security Aspects of Practical Quantum Cryptography p. 289
• Paul Dumais, Dominic Mayers, Louis Salvail: Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation p. 300

Multi-party Computation and Information Theory

• Ronald Cramer, Ivan Damgård, Ueli Maurer: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme p. 316
• Donald Beaver: Minimal-Latency Secure Function Evaluation p. 335
• Ueli Maurer and Stefan Wolf: Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free p. 351

Cryptanalysis II: Public-Key Encryption

• Jean-Sébastien Coron, Marc Joye, David Naccache, et al.: New Attacks on PKCS#1 v1.5 Encryption p. 369
• Éliane Jaulmes and Antoine Joux: A NICE Cryptanalysis p. 382
• Nicolas Courtois, Alexander Klimov, Jacques Patarin, et al.: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations p. 392
• Eli Biham: Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R) p. 408

Invited Talk

• Anthony E Sale: Colossus and the German Lorenz Cipher – Code Breaking in WW II p 417

Zero-Knowledge

• Ivan Damgård: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model p. 418
• Fabrice Boudot: Efficient Proofs that a Committed Number Lies in an Interval p. 431

Symmetric Cryptography

• Victor Shoup: A Composition Theorem for Universal One-Way Hash Functions p. 445
• Ran Canetti, Yevgeniy Dodis, Shai Halevi, et al.: Exposure-Resilient Functions and All-or- Nothing Transforms p. 453
• Stefan Lucks: The Sum of PRPs Is a Secure PRF p. 470

Boolean Functions and Hardware

• Palash Sarkar and Subhamoy Maitra: Construction of Nonlinear Boolean Functions with Important Cryptographic Properties p. 485
• Anne Canteaut, Claude Carlet, Pascale Charpin, et al.: Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions p. 507
• Shinichi Kawamura, Masanobu Koike, Fumihiko Sano, et al.: Cox-Rower Architecture for Fast Parallel Montgomery Multiplication p. 523

Voting Schemes

• Martin Hirt and Kazue Sako: Efficient Receipt-Free Voting Based on Homomorphic Encryption p. 539
• Yvo Desmedt and Kaoru Kurosawa: How to Break a Practical MIX and Design a New One p. 557

Cryptanalysis III: Stream Ciphers and Block Ciphers

• Anne Canteaut and Michaël Trabbia: Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 p. 573
• Alex Biryukov and David Wagner: Advanced Slide Attacks p. 589