Publications of eurocrypt 2001

Preface and frontmatter

Page	Title
1-13	A Memory Efficient Version of Satoh's Algorithm
14-29	Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
30-39	How Secure Are Elliptic Curves over Composite Extension Fields?
40-59	Efficient and Non-interactive Non-malleable Commitment
60-77	How to Convert the Flavor of a Quantum Bit Commitment
78-92	Cryptographic Counters and Applications to Electronic Voting
93-118	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
119-135	Priced Oblivious Transfer: How to Sell Digital Goods
136-151	A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
152-165	Practical Threshold RSA Signatures without a Trusted Dealer
166-181	Hash Functions: From Merkle-Damgård to Shoup
182-194	Key Recovery and Message Attacks on NTRU-Composite
195-210	Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
211-228	NSS: An NTRU Lattice-Based Signature Scheme
229-243	The Bit Security of Paillier's Encryption Scheme and Its Applications
244-261	Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
262-279	On Adaptive vs. Non-adaptive Security of Multiparty Protocols
280-299	Multiparty Computation from Threshold Homomorphic Encryption
301-324	On Perfect and Adaptive Security in Exposure-Resilient Cryptography
325-339	Cryptanalysis of Reduced-Round MISTY
340-357	The Rectangle Attack - Rectangling the Serpent
358-372	Efficient Amplification of the Security of Weak Pseudo-random Function Generators
373-393	Min-round Resettable Zero-Knowledge in the Public-Key Model
394-405	Structural Cryptanalysis of SASAS
406-419	Hyper-bent Functions
420-436	New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs
437-452	Lower Bounds for Multicast Message Authentication
453-474	Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
475-494	Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
495-511	Identification Protocols Secure against Reset Attacks
512-528	Does Encryption with Redundancy Provide Authenticity?
529-544	Encryption Modes with Almost Free Message Integrity