Advances in Cryptology - CRYPTO '97 [electronic resource] : 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings / edited by Burton S.Jr. Kaliski.
- 1st ed. 1997.
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1294
Lecture Notes in Computer Science, 0302-9743 ; 1294
1 online resource (546 pages)
- Data encryption (Computer science)
Management information systems.
Computer science -- Mathematics.
- Local subjects:
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Management of Computing and Information Systems.
Computational Mathematics and Numerical Analysis.
- System Details:
- text file PDF
- 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.
- The complexity of computing hard core predicates
Statistical zero knowledge protocols to prove modular polynomial relations
Keeping the SZK-verifier honest unconditionally
On the foundations of modern cryptography
Plug and play encryption
Eliminating decryption errors in the Ajtai-Dwork Cryptosystem
Public-key cryptosystems from lattice reduction problems
RSA-based undeniable signatures
Security of blind digital signatures
Digital signcryption or how to achieve cost(signature and encryption) ? cost(signature) + cost(encryption)
How to sign digital streams
Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
Failure of the McEliece public-key cryptosystem under message-resend and related-message attack
A multiplicative attack using LLL algorithm on RSA signatures with redundancy
On the security of the KMOV public key cryptosystem
A key recovery attack on discrete log-based schemes using a prime order subgroup
The prevalence of kleptographic attacks on discrete-log based cryptosystems
"Pseudo-random" number generation within cryptographic algorithms: The DDS case
Unconditional security against memory-bounded adversaries
Privacy amplification secure against active adversaries
Visual authentication and identification
Quantum information processing: The good, the bad and the ugly
Efficient algorithms for elliptic curve cryptosystems
An improved algorithm for arithmetic on a family of elliptic curves
Fast RSA-type cryptosystems using n-adic expansion
A one way function based on ideal arithmetic in number fields
Efficient anonymous multicast and reception
Efficient group signature schemes for large groups
Efficient generation of shared RSA keys
Towards realizing random oracles: Hash functions that hide all partial information
Collision-Resistant hashing: Towards making UOWHFs practical
Fast and secure hashing based on codes
Edit distance correlation attack on the alternating step generator
Differential fault analysis of secret key cryptosystems
Cryptanalysis of the cellular message encryption algorithm
Security of 2t-root identification and signatures, proceedings CRYPTO'98.
- Kaliski, Burton S.Jr. editor., Editor,
SpringerLink (Online service)
- Contained In:
- Springer eBooks
- Other format:
- Printed edition:
- Publisher Number:
- 10.1007/BFb0052223 doi
- Access Restriction:
- Restricted for use by site license.
|Location||Notes||Your Loan Policy|
|Description||Status||Barcode||Your Loan Policy|