This book constitutes the refereed proceedings of the 20th Annual International Cryptology Conference, CRYPTO 2000, held in Santa Barbara, CA, USA in August 2000. The 32 revised full papers presented together with one invited contribution were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on XTR and NTRU, privacy for databases, secure distributed computation, algebraic cryptosystems, message authentication, digital signatures, cryptanalysis, traitor tracing and broadcast encryption, symmetric encryption, to commit or not to commit, protocols, and stream ciphers and Boolean functions.
Author(s): Arjen K. Lenstra, Eric R. Verheul (auth.), Mihir Bellare (eds.)
Series: Lecture Notes in Computer Science 1880
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 543
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Management of Computing and Information Systems; Computational Mathematics and Numerical Analysis
The XTR Public Key System....Pages 1-19
A Chosen-Ciphertext Attack against NTRU....Pages 20-35
Privacy Preserving Data Mining....Pages 36-54
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing....Pages 55-73
Parallel Reducibility for Information-Theoretically Secure Computation....Pages 74-92
Optimistic Fair Secure Computation....Pages 93-111
A Cryptographic Solution to a Game Theoretic Problem....Pages 112-130
Differential Fault Attacks on Elliptic Curve Cryptosystems....Pages 131-146
Quantum Public-Key Cryptosystems....Pages 147-165
New Public-Key Cryptosystem Using Braid Groups....Pages 166-183
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm....Pages 184-196
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions....Pages 197-215
L-collision Attacks against Randomized MACs....Pages 216-228
On the Exact Security of Full Domain Hash....Pages 229-235
Timed Commitments....Pages 236-254
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme....Pages 255-270
Provably Secure Partially Blind Signatures....Pages 271-286
Fast Correlation Attacks through Reconstruction of Linear Polynomials....Pages 287-299
Sequential Traitor Tracing....Pages 300-315
Long-Lived Broadcast Encryption....Pages 316-332
Taming the Adversary....Pages 333-352
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search....Pages 353-358
On the Round Security of Symmetric-Key Cryptographic Primitives....Pages 359-375
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack....Pages 376-393
Efficient Non-malleable Commitment Schemes....Pages 394-412
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption....Pages 413-431
A Note on the Round-Complexity of Concurrent Zero-Knowledge....Pages 432-450
An Improved Pseudo-random Generator Based on Discrete Log....Pages 451-468
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?....Pages 469-481
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers....Pages 482-500
Nonlinearity Bounds and Constructions of Resilient Boolean Functions....Pages 501-514
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications....Pages 515-532
....Pages 533-543
