Advances in Cryptology - CRYPTO 2000 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2000, 2000
|
| Edition: | 1st ed. 2000 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- XTR and NTRU
- The XTR Public Key System
- A Chosen-Ciphertext Attack against NTRU
- Privacy for Databases
- Privacy Preserving Data Mining
- Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
- Secure Distributed Computation and Applications
- Parallel Reducibility for Information-Theoretically Secure Computation
- Optimistic Fair Secure Computation
- A Cryptographic Solution to a Game Theoretic Problem
- Algebraic Cryptosystems
- Differential Fault Attacks on Elliptic Curve Cryptosystems
- Quantum Public-Key Cryptosystems
- New Public-Key Cryptosystem Using Braid Groups
- Message Authentication
- Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
- CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
- L-collision Attacks against Randomized MACs
- Digital Signatures
- On the Exact Security of Full Domain Hash
- Timed Commitments
- A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
- Provably Secure Partially Blind Signatures
- Cryptanalysis
- Weaknesses in the SL2( ) Hashing Scheme
- Fast Correlation Attacks through Reconstruction of Linear Polynomials
- Traitor Tracing and Broadcast Encryption
- Sequential Traitor Tracing
- Long-Lived Broadcast Encryption
- Invited Talk
- Taming the Adversary
- Symmetric Encryption
- The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
- On the Round Security of Symmetric-Key Cryptographic Primitives
- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
- To Commit or Not to Commit
- Efficient Non-malleable Commitment Schemes
- Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
- Protocols
- A Note on the Round-Complexity of Concurrent Zero-Knowledge
- An Improved Pseudo-random Generator Based on Discrete Log
- Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
- Stream Ciphers and Boolean Functions
- Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
- Nonlinearity Bounds and Constructions of Resilient Boolean Functions
- Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications