Book Volume 1751 2000

Public Key Cryptography

Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings


ISBN: 978-3-540-66967-8 (Print) 978-3-540-46588-1 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-13

    A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol

  3. Chapter

    Pages 14-27

    An Efficient NICE-Schnorr-Type Signature Scheme

  4. Chapter

    Pages 28-45

    Identification of Bad Signatures in Batches

  5. Chapter

    Pages 46-57

    Some Remarks on a Fair Exchange Protocol

  6. Chapter

    Pages 58-67

    Gaudry’s Variant against C ab Curves

  7. Chapter

    Pages 68-74

    An Identification Scheme Based on Sparse Polynomials

  8. Chapter

    Pages 75-92

    A State-Based Model for Certificate Management Systems

  9. Chapter

    Pages 93-112

    Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence

  10. Chapter

    Pages 113-128

    The Composite Discrete Logarithm and Secure Authentication

  11. Chapter

    Pages 129-146

    Chosen-Ciphertext Security for Any One-Way Cryptosystem

  12. Chapter

    Pages 147-166

    Short Proofs of Knowledge for Factoring

  13. Chapter

    Pages 167-177

    Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms

  14. Chapter

    Pages 178-195

    All-or-Nothing Transform and Remotely Keyed Encryption Protocols

  15. Chapter

    Pages 196-209

    Security of Public Key Certificate Based Authentication Protocols

  16. Chapter

    Pages 210-222

    Efficient Implementation of Schoof’s Algorithm in Case of Characteristic 2

  17. Chapter

    Pages 223-237

    Key Recovery in Third Generation Wireless Communication Systems

  18. Chapter

    Pages 238-257

    Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications

  19. Chapter

    Pages 258-275

    Certificates of Recoverability with Scalable Recovery Agent Security

  20. Chapter

    Pages 276-292

    Design Validations for Discrete Logarithm Based Signature Schemes

  21. Chapter

    Pages 293-305

    Optimally Efficient Accountable Time-Stamping

previous Page of 2