EUROCRYPT 2001

AARHUS, DENMARK

B. Pfitzmann (Ed.): Advances in Cryptology - EUROCRYPT 2001: Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings. Lecture Notes in Computer Science, Vol. 2045, Springer, 2001, ISBN 3-540-42070-3

Elliptic Curves

• Frederik Vercauteren, Bart Preneel, Joos Vandewalle: A Memory Efficient Version of Satoh's Algorithm p. 1
• Mireille Fouquet, Pierrick Gaudry, Robert Harley: Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy p. 14
• Nigel P. Smart: How Secure Are Elliptic Curves over Composite Extension Fields? p. 30

Commitments

• Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, et al.: Efficient and Non-interactive Non-malleable Commitment p. 40
• Claude Crépeau, Frédéric Légaré, Louis Salvail: How to Convert the Flavor of a Quantum Bit Commitment p. 60

Anonymity

• Jonathan Katz, Steven Myers, Rafail Ostrovsky: Cryptographic Counters and Applications to Electronic Voting p. 78
• Jan Camenisch and Anna Lysyanskaya: An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation p. 93
• Bill Aiello, Yuval Ishai, Omer Reingold: Priced Oblivious Transfer: How to Sell Digital Goods p. 119

Signatures and Hash Functions

• Masayuki Abe: A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures p. 136
• Ivan Damgård and Maciej Koprowski: Practical Threshold RSA Signatures without a Trusted Dealer p. 152
• Ilya Mironov: Hash Functions: From Merkle-Damgård to Shoup p. 166

XTR and NTRU

• Craig Gentry: Key Recovery and Message Attacks on NTRU-Composite p. 182
• Eric R. Verheul: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems p. 195
• Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman: NSS: An NTRU Lattice-Based Signature Scheme p. 211

Assumptions

• Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham: The Bit Security of Paillier's Encryption Scheme and Its Applications p. 229
• Ahmad-Reza Sadeghi and Michael Steiner: Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference p. 244

Multiparty Protocols

• Ran Canetti, Ivan Damgrd, Stefan Dziembowski, et al.: On Adaptive vs. Non-adaptive Security of Multiparty Protocols p. 262
• Ronald Cramer, Ivan Damgård, Jesper B. Nielsen: Multiparty Computation from Threshold Homomorphic Encryption p. 280
• Yevgeniy Dodis, Amit Sahai, Adam Smith: On Perfect and Adaptive Security in Exposure- Resilient Cryptography p. 301

Block Ciphers

• Ulrich Kühn: Cryptanalysis of Reduced-Round MISTY p. 325
• Eli Biham, Orr Dunkelman, Nathan Keller: The Rectangle Attack - Rectangling the Serpent p. 340

Primitives

• Steven Myers: Efficient Amplification of the Security of Weak Pseudo-random Function Generators p. 358
• Silvio Micali and Leonid Reyzin: Min-round Resettable Zero-Knowledge in the Public-Key Model p. 373

Symmetric Ciphers

• Alex Biryukov and Adi Shamir: Structural Cryptanalysis of SASAS p. 394
• Amr M. Youssef and Guang Gong: Hyper-bent Functions p. 406
• Liam Keliher, Henk Meijer, Stafford Tavares: New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs p. 420

Key Exchange and Multicast

• Dan Boneh, Glenn Durfee, Matt Franklin: Lower Bounds for Multicast Message Authentication p. 437
• Ran Canetti and Hugo Krawczyk: Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels p. 453
• Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords p. 475

Authentication and Identification

• Mihir Bellare, Marc Fischlin, Shafi Goldwasser, et al.: Identification Protocols Secure against Reset Attacks p. 495
• Jee Hea An and Mihir Bellare: Does Encryption with Redundancy Provide Authenticity? p. 512
• Charanjit S. Jutla: Encryption Modes with Almost Free Message Integrity p. 529