Advances in Cryptology - CRYPTO 2001

1. Front Matter

   Pages I-XI

   PDF

2. Foundations

   1. On the (Im)possibility of Obfuscating Programs

      • Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan et al.

      Pages 1-18

   2. Universally Composable Commitments

      • Ran Canetti, Marc Fischlin

      Pages 19-40

3. Traitor Tracing

   1. Revocation and Tracing Schemes for Stateless Receivers

      • Dalit Naor, Moni Naor, Jeff Lotspiech

      Pages 41-62

   2. Self Protecting Pirates and Black-Box Traitor Tracing

      • Aggelos Kiayias, Moti Yung

      Pages 63-79

4. Multi-party Computation

   1. Minimal Complete Primitives for Secure Multi-party Computation

      • Matthias Fitzi, Juan A. Garay, Ueli Maurer, Rafail Ostrovsky

      Pages 80-100

   2. Robustness for Free in Unconditional Multi-party Computation

      • Martin Hirt, Ueli Maurer

      Pages 101-118

   3. Secure Distributed Linear Algebra in a Constant Number of Rounds

      • Ronald Cramer, Ivan Damgård

      Pages 119-136

5. Two-Party Computation

   1. Two-Party Generation of DSA Signatures

      • Philip MacKenzie, Michael K. Reiter

      Pages 137-154

   2. Oblivious Transfer in the Bounded Storage Model

      • Yan Zong Ding

      Pages 155-170

   3. Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

      • Yehuda Lindell

      Pages 171-189

6. Elliptic Curves

   1. Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms

      • Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone

      Pages 190-200

   2. On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme

      • Dan Boneh, Igor E. Shparlinski

      Pages 201-212

   3. Identity-Based Encryption from the Weil Pairing

      • Dan Boneh, Matt Franklin

      Pages 213-229

7. OAEP

   1. A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0

      • James Manger

      Pages 230-238

   2. OAEP Reconsidered

      • Victor Shoup

      Pages 239-259

   3. RSA-OAEP Is Secure under the RSA Assumption

      • Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern

      Pages 260-274

   4. Simplified OAEP for the RSA and Rabin Functions

      • Dan Boneh

      Pages 275-291

8. Encryption and Authentication

   1. Online Ciphers and the Hash-CBC Construction

      • Mihir Bellare, Alexandra Boldyreva, Lars Knudsen, Chanathip Namprempre

      Pages 292-309

   2. The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)

      • Hugo Krawczyk

      Pages 310-331

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.

• Algorithmic Number Theory
• Cryptanalysis
• Cryptographic Protocols
• Cryptography
• Data Encryption
• Digital Signatures
• Elliptic Curves
• Finite Field Computation
• Privacy
• Secure Networking
• Security
• Systems Security
• coding theory
• algorithm analysis and problem complexity

• Yianilos Labs., Princeton, USA

  Joe Kilian

Policies and ethics