Crypto 2001, the 21st Annual Crypto conference, was sponsored by the Int- national Association for Cryptologic Research (IACR) in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of California at Santa Barbara. The conference received 156 submissions, of which the program committee selected 34 for presentation; one was later withdrawn. These proceedings contain the revised versions of the 33 submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. The conference program included two invited lectures. Mark Sherwin spoke on, \Quantum information processing in semiconductors: an experimentalist’s view." Daniel Weitzner spoke on, \Privacy, Authentication & Identity: A recent history of cryptographic struggles for freedom." The conference program also included its perennial \rump session," chaired by Stuart Haber, featuring short, informal talks on late{breaking research news. As I try to account for the hours of my life that ?ew o to oblivion, I realize that most of my time was spent cajoling talented innocents into spending even more time on my behalf. I have accumulated more debts than I can ever hope to repay. As mere statements of thanks are certainly insu cient, consider the rest of this preface my version of Chapter 11.
Author(s): Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan (auth.), Joe Kilian (eds.)
Series: Lecture Notes in Computer Science 2139
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 604
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Mathematics of Computing; Operating Systems; Computer Communication Networks; Management of Computing and Information Systems
On the (Im)possibility of Obfuscating Programs....Pages 1-18
Universally Composable Commitments....Pages 19-40
Revocation and Tracing Schemes for Stateless Receivers....Pages 41-62
Self Protecting Pirates and Black-Box Traitor Tracing....Pages 63-79
Minimal Complete Primitives for Secure Multi-party Computation....Pages 80-100
Robustness for Free in Unconditional Multi-party Computation....Pages 101-118
Secure Distributed Linear Algebra in a Constant Number of Rounds....Pages 119-136
Two-Party Generation of DSA Signatures....Pages 137-154
Oblivious Transfer in the Bounded Storage Model....Pages 155-170
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation....Pages 171-189
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms....Pages 190-200
On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme....Pages 201-212
Identity-Based Encryption from the Weil Pairing....Pages 213-229
A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0....Pages 230-238
OAEP Reconsidered....Pages 239-259
RSA-OAEP Is Secure under the RSA Assumption....Pages 260-274
Simplified OAEP for the RSA and Rabin Functions....Pages 275-291
Online Ciphers and the Hash-CBC Construction....Pages 292-309
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)....Pages 310-331
Forward-Secure Signatures with Optimal Signing and Verifying....Pages 332-354
Improved Online/Offline Signature Schemes....Pages 355-367
An Efficient Scheme for Proving a Shuffle....Pages 368-387
An Identity Escrow Scheme with Appointed Verifiers....Pages 388-407
Session-Key Generation Using Human Passwords Only....Pages 408-432
Cryptanalysis of RSA Signatures with Fixed-Pattern Padding....Pages 433-439
Correlation Analysis of the Shrinking Generator....Pages 440-457
Nonlinear Vector Resilient Functions....Pages 458-469
New Public Key Cryptosystem Using Finite Non Abelian Groups....Pages 470-485
Pseudorandomness from Braid Groups....Pages 486-502
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase....Pages 503-523
Secure and Efficient Asynchronous Broadcast Protocols....Pages 524-541
Soundness in the Public-Key Model....Pages 542-565
Robust Non-interactive Zero Knowledge....Pages 566-598
