Advances in Cryptology – EUROCRYPT 2001

1. Front Matter

   Pages I-XII

   PDF

2. Elliptic Curves

   1. A Memory Efficient Version of Satoh’s Algorithm

      • Frederik Vercauteren, Bart Preneel, Joos Vandewalle

      Pages 1-13

   2. Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy

      • Mireille Fouquet, Pierrick Gaudry, Robert Harley

      Pages 14-29

   3. How Secure Are Elliptic Curves over Composite Extension Fields?

      • Nigel P. Smart

      Pages 30-39

3. Commitments

   1. Efficient and Non-interactive Non-malleable Commitment

      • Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith

      Pages 40-59

   2. How to Convert the Flavor of a Quantum Bit Commitment

      • Claude Crépeau, Frédéric Légaré, Louis Salvail

      Pages 60-77

4. Anonymity

   1. Cryptographic Counters and Applications to Electronic Voting

      • Jonathan Katz, Steven Myers, Rafail Ostrovsky

      Pages 78-92

   2. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

      • Jan Camenisch, Anna Lysyanskaya

      Pages 93-118

   3. Priced Oblivious Transfer: How to Sell Digital Goods

      • Bill Aiello, Yuval Ishai, Omer Reingold

      Pages 119-135

5. Signatures and Hash Functions

   1. A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures

      • Masayuki Abe

      Pages 136-151

   2. Practical Threshold RSA Signatures without a Trusted Dealer

      • Ivan Damgård, Maciej Koprowski

      Pages 152-165

   3. Hash Functions: From Merkle-Damgård to Shoup

      • Ilya Mironov

      Pages 166-181

6. XTR and NTRU

   1. Key Recovery and Message Attacks on NTRU-Composite

      • Craig Gentry

      Pages 182-194

   2. Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

      • Eric R. Verheul

      Pages 195-210

   3. NSS: An NTRU Lattice-Based Signature Scheme

      • Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman

      Pages 211-228

7. Assumptions

   1. The Bit Security of Paillier’s Encryption Scheme and Its Applications

      • Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham

      Pages 229-243

   2. Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference

      • Ahmad-Reza Sadeghi, Michael Steiner

      Pages 244-261

8. Multiparty Protocols

   1. On Adaptive vs. Non-adaptive Security of Multiparty Protocols

      • Ran Canetti, Ivan Damgaard, Stefan Dziembowski, Yuval Ishai, Tal Malkin

      Pages 262-279

   2. Multiparty Computation from Threshold Homomorphic Encryption

      • Ronald Cramer, Ivan Damgård, Jesper B. Nielsen

      Pages 280-300

   3. On Perfect and Adaptive Security in Exposure-Resilient Cryptography

      • Yevgeniy Dodis, Amit Sahai, Adam Smith

      Pages 301-324

EUROCRYPT 2001, the 20th annual Eurocrypt conference, was sponsored by the IACR, the International Association for Cryptologic Research, see http://www. iacr. org/, this year in cooperation with the Austrian Computer - ciety (OCG). The General Chair, Reinhard Posch, was responsible for local or- nization, and registration was handled by the IACR Secretariat at the University of California, Santa Barbara. In addition to the papers contained in these proceedings, we were pleased that the conference program also included a presentation by the 2001 IACR d- tinguished lecturer, Andrew Odlyzko, on “Economics and Cryptography” and an invited talk by Silvio Micali, “Zero Knowledge Has Come of Age. ” Furthermore, there was the rump session for presentations of recent results and other (p- sibly satirical) topics of interest to the crypto community, which Jean-Jacques Quisquater kindly agreed to run. The Program Committee received 155 submissions and selected 33 papers for presentation; one of them was withdrawn by the authors. The review process was therefore a delicate and challenging task for the committee members, and I wish to thank them for all the e?ort they spent on it. Each committee member was responsible for the review of at least 20 submissions, so each paper was carefully evaluated by at least three reviewers, and submissions with a program committee member as a (co-)author by at least six.

• anonymity
• authentication
• cryptoanalysis
• cryptographic protocol
• cryptology
• cryptosystems
• data security
• digital signature
• encryption
• hash function
• information hiding
• information security
• privacy
• secure networks
• systems security
• algorithm analysis and problem complexity

• Fachrichtung Informatik, Universität des Saarlandes, Saarbrücken, Germany

  Birgit Pfitzmann

Policies and ethics