EUROCRYPT 2000: Bruges, Belgium

Factoring and Discrete Logarithm

• Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann:
  Factorization of a 512-Bit RSA Modulus. 1-18
  
• Pierrick Gaudry:
  An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. 19-34
  
• Arjen K. Lenstra, Adi Shamir:
  Analysis and Optimization of the TWINKLE Factoring Device. 35-52
  

Cryptanalysis I: Digital Signatures

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

Invited Talk

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

Private Information Retrieval

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

Key Management Protocols

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

Threshold Cryptography and Digital Signatures

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

Public-Key Encryption

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

Quantum Cryptography

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

Multi-party Computation and Information Theory

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

Cryptanalysis II: Public-Key Encryption

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

Invited Talk

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

Zero-Knowledge

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

Symmetric Cryptography

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

Boolean Functions and Hardware

• Palash Sarkar, Subhamoy Maitra:
  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties. 485-506
  
• Anne Canteaut, Claude Carlet, Pascale Charpin, Caroline Fontaine:
  Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions. 507-522
  
• Shin-ichi Kawamura, Masanobu Koike, Fumihiko Sano, Atsushi Shimbo:
  Cox-Rower Architecture for Fast Parallel Montgomery Multiplication. 523-538
  

Voting Schemes

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

Cryptanalysis III: Stream Ciphers and Block Ciphers

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