Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of crypto 2000
Page
Title
1-19
The XTR Public Key System
20-35
A Chosen-Ciphertext Attack against NTRU
36-54
Privacy Preserving Data Mining
55-73
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
74-92
Parallel Reducibility for Information-Theoretically Secure Computation
93-111
Optimistic Fair Secure Computation
112-130
A Cryptographic Solution to a Game Theoretic Problem
131-146
Differential Fault Attacks on Elliptic Curve Cryptosystems
147-165
Quantum Public-Key Cryptosystems
166-183
New Public-Key Cryptosystem Using Braid Groups
184-196
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
197-215
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
216-228
L-collision Attacks against Randomized MACs
229-235
On the Exact Security of Full Domain Hash
236-254
Timed Commitments
255-270
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
271-286
Provably Secure Partially Blind Signatures
287-299
Weaknesses in the SL
2
(IF
s
2
) Hashing Scheme
300-315
Fast Correlation Attacks through Reconstruction of Linear Polynomials
316-332
Sequential Traitor Tracing
333-352
Long-Lived Broadcast Encryption
353-358
Taming the Adversary
359-375
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
376-393
On the Round Security of Symmetric-Key Cryptographic Primitives
394-412
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
413-431
Efficient Non-malleable Commitment Schemes
432-450
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
451-468
A Note on the Round-Complexity of Concurrent Zero-Knowledge
469-481
An Improved Pseudo-random Generator Based on Discrete Log
482-500
Linking Classical and Quantum Key Agreement: Is There ``Bound Information''?
501-514
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
515-532
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
533-544
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications