Book Volume 2045 2001

Advances in Cryptology — EUROCRYPT 2001

International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings


ISBN: 978-3-540-42070-5 (Print) 978-3-540-44987-4 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XII

  2. Elliptic Curves

    1. Chapter

      Pages 1-13

      A Memory Efficient Version of Satoh’s Algorithm

    2. Chapter

      Pages 14-29

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

    3. Chapter

      Pages 30-39

      How Secure Are Elliptic Curves over Composite Extension Fields?

  3. Commitments

    1. Chapter

      Pages 40-59

      Efficient and Non-interactive Non-malleable Commitment

    2. Chapter

      Pages 60-77

      How to Convert the Flavor of a Quantum Bit Commitment

  4. Anonymity

    1. Chapter

      Pages 78-92

      Cryptographic Counters and Applications to Electronic Voting

    2. Chapter

      Pages 93-118

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

    3. Chapter

      Pages 119-135

      Priced Oblivious Transfer: How to Sell Digital Goods

  5. Signatures and Hash Functions

    1. Chapter

      Pages 136-151

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

    2. Chapter

      Pages 152-165

      Practical Threshold RSA Signatures without a Trusted Dealer

    3. Chapter

      Pages 166-181

      Hash Functions: From Merkle-Damgård to Shoup

  6. XTR and NTRU

    1. Chapter

      Pages 182-194

      Key Recovery and Message Attacks on NTRU-Composite

    2. Chapter

      Pages 195-210

      Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

    3. Chapter

      Pages 211-228

      NSS: An NTRU Lattice-Based Signature Scheme

  7. Assumptions

    1. Chapter

      Pages 229-243

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

    2. Chapter

      Pages 244-261

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

  8. Multiparty Protocols

    1. Chapter

      Pages 262-279

      On Adaptive vs. Non-adaptive Security of Multiparty Protocols

    2. Chapter

      Pages 280-300

      Multiparty Computation from Threshold Homomorphic Encryption

    3. Chapter

      Pages 301-324

      On Perfect and Adaptive Security in Exposure-Resilient Cryptography

  9. Block Ciphers

    1. Chapter

      Pages 325-339

      Cryptanalysis of Reduced-Round MISTY

previous Page of 2