This book constitutes the refereed proceedings of the 18th Annual International Cryptology Conference, CRYPTO'98, held in Santa Barbara, California, USA, in August 1998. The book presents 33 revised full papers selected from a total of 144 submissions received. Also included are two invited presentations. The papers are organized in topical sections on chosen ciphertext security, cryptanalysis of hash functions and block ciphers, distributed cryptography, zero knowledge, and implementation.
Author(s): Daniel Bleichenbacher (auth.), Hugo Krawczyk (eds.)
Series: Lecture Notes in Computer Science 1462
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Language: English
Pages: 524
Tags: Data Encryption; Discrete Mathematics in Computer Science; Computer Communication Networks; Management of Computing and Information Systems; Computational Mathematics and Numerical Analysis
Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1....Pages 1-12
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack....Pages 13-25
Relations among notions of security for public-key encryption schemes....Pages 26-45
Cryptography and the internet....Pages 46-55
Differential collisions in SHA-0....Pages 56-71
From differential cryptanalysis to ciphertext-only attacks....Pages 72-88
A simplified approach to threshold and proactive RSA....Pages 89-104
New efficient and secure protocols for verifiable signature sharing and other applications....Pages 105-120
Trading correctness for privacy in unconditional multi-party computation....Pages 121-136
Fast digital identity revocation....Pages 137-152
Self-delegation with controlled propagation — or — What if you lose your laptop....Pages 153-168
Identity escrow....Pages 169-185
Generalized birthday attacks on unbalanced Feistel networks....Pages 186-199
Quadratic relation of S-box and its application to the linear attack of full round DES....Pages 200-211
Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree....Pages 212-222
Cryptanalysis of the Ajtai-Dwork cryptosystem....Pages 223-242
Cryptanalysis of the Chor-Rivest cryptosystem....Pages 243-256
Cryptanalysis of the oil and vinegar signature scheme....Pages 257-266
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs....Pages 267-282
Many-to-one trapdoor functions and their relation to public-key cryptosystems....Pages 283-298
Authentication, enhanced security and error correcting codes....Pages 299-303
An efficient discrete log pseudo random generator....Pages 304-317
Fast RSA-type cryptosystem modulo p k q ....Pages 318-326
An elliptic curve implementation of the finite field digital signature algorithm....Pages 327-337
Quantum bit commitment from a physical assumption....Pages 338-353
On concrete security treatment of signatures derived from identification....Pages 354-369
Building PRFs from PRPs....Pages 370-389
Security amplification by composition: The case of doubly-iterated, ideal ciphers....Pages 390-407
On the existence of 3-round zero-knowledge protocols....Pages 408-423
Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?....Pages 424-441
Concurrent zero-knowledge: Reducing the need for timing constraints....Pages 442-457
The solution of McCurley's discrete log challenge....Pages 458-471
Optimal extension fields for fast arithmetic in public-key algorithms....Pages 472-485
Time-stamping with binary linking schemes....Pages 486-501
Threshold traitor tracing....Pages 502-517
