Advances in Cryptology — CRYPTO '97

17th Annual International Cryptology Conference Santa Barbara, California, USA August 17–21, 1997 Proceedings

Editors:

ISBN: 978-3-540-63384-6 (Print) 978-3-540-69528-8 (Online)

Table of contents (38 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Book Chapter

    Pages 1-15

    The complexity of computing hard core predicates

  3. Book Chapter

    Pages 16-30

    Statistical zero knowledge protocols to prove modular polynomial relations

  4. Book Chapter

    Pages 31-45

    Keeping the SZK-verifier honest unconditionally

  5. Book Chapter

    Pages 46-74

    On the foundations of modern cryptography

  6. Book Chapter

    Pages 75-89

    Plug and play encryption

  7. Book Chapter

    Pages 90-104

    Deniable Encryption

  8. Book Chapter

    Pages 105-111

    Eliminating decryption errors in the Ajtai-Dwork Cryptosystem

  9. Book Chapter

    Pages 112-131

    Public-key cryptosystems from lattice reduction problems

  10. Book Chapter

    Pages 132-149

    RSA-based undeniable signatures

  11. Book Chapter

    Pages 150-164

    Security of blind digital signatures

  12. Book Chapter

    Pages 165-179

    Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption)

  13. Book Chapter

    Pages 180-197

    How to sign digital streams

  14. Book Chapter

    Pages 198-212

    Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations

  15. Book Chapter

    Pages 213-220

    Failure of the McEliece public-key cryptosystem under message-resend and related-message attack

  16. Book Chapter

    Pages 221-234

    A multiplicative attack using LLL algorithm on RSA signatures with redundancy

  17. Book Chapter

    Pages 235-248

    On the security of the KMOV public key cryptosystem

  18. Book Chapter

    Pages 249-263

    A key recovery attack on discrete log-based schemes using a prime order subgroup

  19. Book Chapter

    Pages 264-276

    The prevalence of kleptographic attacks on discrete-log based cryptosystems

  20. Book Chapter

    Pages 277-291

    “Pseudo-random” number generation within cryptographic algorithms: The DDS case

  21. Book Chapter

    Pages 292-306

    Unconditional security against memory-bounded adversaries

previous Page of 2