English
Advances in Cryptology — CRYPTO 2000
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 The XTR Public Key System
-
Altmetric BadgeChapter 2 A Chosen-Ciphertext Attack against NTRU
-
Altmetric BadgeChapter 3 Privacy Preserving Data Mining
-
Altmetric BadgeChapter 4 Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
-
Altmetric BadgeChapter 5 Parallel Reducibility for Information-Theoretically Secure Computation
-
Altmetric BadgeChapter 6 Optimistic Fair Secure Computation
-
Altmetric BadgeChapter 7 A Cryptographic Solution to a Game Theoretic Problem
-
Altmetric BadgeChapter 8 Differential Fault Attacks on Elliptic Curve Cryptosystems
-
Altmetric BadgeChapter 9 Quantum Public-Key Cryptosystems
-
Altmetric BadgeChapter 10 New Public-Key Cryptosystem Using Braid Groups
-
Altmetric BadgeChapter 11 Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
-
Altmetric BadgeChapter 12 Advances in Cryptology — CRYPTO 2000
-
Altmetric BadgeChapter 13 L-collision Attacks against Randomized MACs
-
Altmetric BadgeChapter 14 On the Exact Security of Full Domain Hash
-
Altmetric BadgeChapter 15 Timed Commitments
-
Altmetric BadgeChapter 16 A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
-
Altmetric BadgeChapter 17 Provably Secure Partially Blind Signatures
-
Altmetric BadgeChapter 18 Weaknesses in the SL 2 ( $$ \mathbb{F}_{2^n } $$ ) Hashing Scheme
-
Altmetric BadgeChapter 19 Fast Correlation Attacks through Reconstruction of Linear Polynomials
-
Altmetric BadgeChapter 20 Sequential Traitor Tracing
-
Altmetric BadgeChapter 21 Long-Lived Broadcast Encryption
-
Altmetric BadgeChapter 22 Taming the Adversary
-
Altmetric BadgeChapter 23 The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
-
Altmetric BadgeChapter 24 On the Round Security of Symmetric-Key Cryptographic Primitives
-
Altmetric BadgeChapter 25 New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
-
Altmetric BadgeChapter 26 Efficient Non-malleable Commitment Schemes
-
Altmetric BadgeChapter 27 Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
-
Altmetric BadgeChapter 28 A Note on the Round-Complexity of Concurrent Zero-Knowledge
-
Altmetric BadgeChapter 29 An Improved Pseudo-random Generator Based on Discrete Log
-
Altmetric BadgeChapter 30 Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
-
Altmetric BadgeChapter 31 Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
-
Altmetric BadgeChapter 32 Nonlinearity Bounds and Constructions of Resilient Boolean Functions
-
Altmetric BadgeChapter 33 Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications