Advances in Cryptology — CRYPTO ’97: 17th Annual International Cryptology Conference Santa Barbara, California, USA August 17–21, 1997 Proceedings

Mikael Goldmann, Mats NÄslund (auth.), Burton S. Kaliski Jr. (eds.)3540633847, 9783540633846

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.

---

Table of contents :
Front Matter….Pages –
The complexity of computing hard core predicates….Pages 1-15
Statistical zero knowledge protocols to prove modular polynomial relations….Pages 16-30
Keeping the SZK-verifier honest unconditionally….Pages 31-45
On the foundations of modern cryptography….Pages 46-74
Plug and play encryption….Pages 75-89
Deniable Encryption….Pages 90-104
Eliminating decryption errors in the Ajtai-Dwork Cryptosystem….Pages 105-111
Public-key cryptosystems from lattice reduction problems….Pages 112-131
RSA-based undeniable signatures….Pages 132-149
Security of blind digital signatures….Pages 150-164
Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature) + cost(encryption)….Pages 165-179
How to sign digital streams….Pages 180-197
Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations….Pages 198-212
Failure of the McEliece public-key cryptosystem under message-resend and related-message attack….Pages 213-220
A multiplicative attack using LLL algorithm on RSA signatures with redundancy….Pages 221-234
On the security of the KMOV public key cryptosystem….Pages 235-248
A key recovery attack on discrete log-based schemes using a prime order subgroup….Pages 249-263
The prevalence of kleptographic attacks on discrete-log based cryptosystems….Pages 264-276
“Pseudo-random” number generation within cryptographic algorithms: The DDS case….Pages 277-291
Unconditional security against memory-bounded adversaries….Pages 292-306
Privacy amplification secure against active adversaries….Pages 307-321
Visual authentication and identification….Pages 322-336
Quantum information processing: The good, the bad and the ugly….Pages 337-341
Efficient algorithms for elliptic curve cryptosystems….Pages 342-356
An improved algorithm for arithmetic on a family of elliptic curves….Pages 357-371
Fast RSA-type cryptosystems using n-adic expansion….Pages 372-384
A one way function based on ideal arithmetic in number fields….Pages 385-394
Efficient anonymous multicast and reception….Pages 395-409
Efficient group signature schemes for large groups….Pages 410-424
Efficient generation of shared RSA keys….Pages 425-439
Proactive RSA….Pages 440-454
Towards realizing random oracles: Hash functions that hide all partial information….Pages 455-469
Collision-Resistant hashing: Towards making UOWHFs practical….Pages 470-484
Fast and secure hashing based on codes….Pages 485-498
Edit distance correlation attack on the alternating step generator….Pages 499-512
Differential fault analysis of secret key cryptosystems….Pages 513-525
Cryptanalysis of the cellular message encryption algorithm….Pages 526-537
Security of 2 t -root identification and signatures, proceedings CRYPTO’98….Pages 540-540
Back Matter….Pages –