Advances in Cryptology — EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings
Author: Birgit Pfitzmann
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42070-5
DOI: 10.1007/3-540-44987-6

Table of Contents:

• A Memory Efficient Version of Satoh’s Algorithm
  
• Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
  
• How Secure Are Elliptic Curves over Composite Extension Fields?
  
• Efficient and Non-interactive Non-malleable Commitment
  
• How to Convert the Flavor of a Quantum Bit Commitment
  
• Cryptographic Counters and Applications to Electronic Voting
  
• An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
  
• Priced Oblivious Transfer: How to Sell Digital Goods
  
• A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
  
• Practical Threshold RSA Signatures without a Trusted Dealer
  
• Hash Functions: From Merkle-Damgård to Shoup
  
• Key Recovery and Message Attacks on NTRU-Composite
  
• Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
  
• NSS: An NTRU Lattice-Based Signature Scheme
  
• The Bit Security of Paillier’s Encryption Scheme and Its Applications
  
• Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
  
• On Adaptive vs. Non-adaptive Security of Multiparty Protocols
  
• Multiparty Computation from Threshold Homomorphic Encryption
  
• On Perfect and Adaptive Security in Exposure-Resilient Cryptography
  
• Cryptanalysis of Reduced-Round MISTY