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 2001
Preface and frontmatter
Page
Title
1-18
On the (Im)possibility of Obfuscating Programs
19-40
Universally Composable Commitments
41-62
Revocation and Tracing Schemes for Stateless Receivers
63-79
Self Protecting Pirates and Black-Box Traitor Tracing
80-100
Minimal Complete Primitives for Secure Multi-party Computation
101-118
Robustness for Free in Unconditional Multi-party Computation
119-136
Secure Distributed Linear Algebra in a Constant Number of Rounds
137-154
Two-Party Generation of DSA Signatures
155-170
Oblivious Transfer in the Bounded Storage Model
171-189
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
190-200
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
201-212
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme
213-229
Identity-Based Encryption from the Weil Pairing
230-238
A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
239-259
OAEP Reconsidered
260-274
RSA-OAEP Is Secure under the RSA Assumption
275-291
Simplified OAEP for the RSA and Rabin Functions
292-309
Online Ciphers and the Hash-CBC Construction
310-331
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
332-354
Forward-Secure Signatures with Optimal Signing and Verifying
355-367
Improved Online/Offline Signature Schemes
368-387
An Efficient Scheme for Proving a Shuffle
388-407
An Identity Escrow Scheme with Appointed Verifiers
408-432
Session-Key Generation Using Human Passwords Only
433-439
Cryptanalysis of RSA Signatures with Fixed-Pattern Padding
440-457
Correlation Analysis of the Shrinking Generator
458-469
Nonlinear Vector Resilient Functions
470-485
New Public Key Cryptosystem Using Finite Non Abelian Groups
486-502
Pseudorandomness from Braid Groups
503-523
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
524-541
Secure and Efficient Asynchronous Broadcast Protocols
542-565
Soundness in the Public-Key Model
566-598
Robust Non-interactive Zero Knowledge