Advances in Cryptology - CRYPTO '97

1. Front Matter

   PDF

2. The complexity of computing hard core predicates

   • Mikael Goldmann, Mats NÄslund

   Pages 1-15

3. Statistical zero knowledge protocols to prove modular polynomial relations

   • Eiichiro Fujisaki, Tatsuaki Okamoto

   Pages 16-30

4. Keeping the SZK-verifier honest unconditionally

   • Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung

   Pages 31-45

5. On the foundations of modern cryptography

   • Oded Goldreich

   Pages 46-74

6. Plug and play encryption

   • Donald Beaver

   Pages 75-89

7. Deniable Encryption

   • Rein Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky

   Pages 90-104

8. Eliminating decryption errors in the Ajtai-Dwork Cryptosystem

   • Oded Goldreich, Shafi Goldwasser, Shai Halevi

   Pages 105-111

9. Public-key cryptosystems from lattice reduction problems

   • Oded Goldreich, Shafi Goldwasser, Shai Halevi

   Pages 112-131

10. RSA-based undeniable signatures

    • Rosario Gennaro, Hugo Krawczyk, Tal Rabin

    Pages 132-149

11. Security of blind digital signatures

    • Ari Juels, Michael Luby, Rafail Ostrovsky

    Pages 150-164

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

    • Yuliang Zheng

    Pages 165-179

13. How to sign digital streams

    • Rosario Gennaro, Pankaj Rohatgi

    Pages 180-197

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

    • Phong Nguyen, Jacques Stern

    Pages 198-212

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

    • Thomas A. Berson

    Pages 213-220

16. A multiplicative attack using LLL algorithm on RSA signatures with redundancy

    • Jean -FranÇois Misarsky

    Pages 221-234

17. On the security of the KMOV public key cryptosystem

    • D. Bleichenbacher

    Pages 235-248

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

    • Chae Hoon Lim, Pil Joong Lee

    Pages 249-263

19. The prevalence of kleptographic attacks on discrete-log based cryptosystems

    • Adam Young, Moti Yung

    Pages 264-276

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

    • Mihir Bellare, Shafi Goldwasser, Daniele Micciancio

    Pages 277-291

This book constitutes the refereed proceedings of the 17th Annual International Cryptology Conference, CRYPTO'97, held in Santa Barbara, California, USA, in August 1997 under the sponsorship of the International Association for Cryptologic Research (IACR).
The volume presents 35 revised full papers selected from 160 submissions received. Also included are two invited presentations. The papers are organized in sections on complexity theory, cryptographic primitives, lattice-based cryptography, digital signatures, cryptanalysis of public-key cryptosystems, information theory, elliptic curve implementation, number-theoretic systems, distributed cryptography, hash functions, cryptanalysis of secret-key cryptosystems.

• Cryptanalysis
• Digital Signatures
• Distributed Cryptography
• Hash Functions
• Public Key
• Public-Key Cryptography
• STATISTICA
• Sage
• Signatur
• algorithms
• complexity
• complexity theory
• cryptology
• information theory
• security
• algorithm analysis and problem complexity

Policies and ethics