21. CRYPTO 2001: Santa Barbara, California, USA

Foundations

• Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang:
  On the (Im)possibility of Obfuscating Programs. 1-18
  
• Ran Canetti, Marc Fischlin:
  Universally Composable Commitments. 19-40
  

Traitor Tracing

• Dalit Naor, Moni Naor, Jeffery Lotspiech:
  Revocation and Tracing Schemes for Stateless Receivers. 41-62
  
• Aggelos Kiayias, Moti Yung:
  Self Protecting Pirates and Black-Box Traitor Tracing. 63-79
  

Multi-party Computation

• Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
  Minimal Complete Primitives for Secure Multi-party Computation. 80-100
  
• Martin Hirt, Ueli M. Maurer:
  Robustness for Free in Unconditional Multi-party Computation. 101-118
  
• Ronald Cramer, Ivan Damgård:
  Secure Distributed Linear Algebra in a Constant Number of Rounds. 119-136
  

Two-Party Computation

• Philip D. MacKenzie, Michael K. Reiter:
  Two-Party Generation of DSA Signatures. 137-154
  
• Yan Zong Ding:
  Oblivious Transfer in the Bounded Storage Model. 155-170
  
• Yehuda Lindell:
  Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. 171-189
  

Elliptic Curves

• Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone:
  Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. 190-200
  
• Dan Boneh, Igor Shparlinski:
  On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme. 201-212
  
• Dan Boneh, Matthew K. Franklin:
  Identity-Based Encryption from the Weil Pairing. 213-229
  

OAEP

• James Manger:
  A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0. 230-238
  
• Victor Shoup:
  OAEP Reconsidered. 239-259
  
• Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval, Jacques Stern:
  RSA-OAEP Is Secure under the RSA Assumption. 260-274
  
• Dan Boneh:
  Simplified OAEP for the RSA and Rabin Functions. 275-291
  

Encryption and Authentication

• Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre:
  Online Ciphers and the Hash-CBC Construction. 292-309
  
• Hugo Krawczyk:
  The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?). 310-331
  

Signature Schemes

• Gene Itkis, Leonid Reyzin:
  Forward-Secure Signatures with Optimal Signing and Verifying. 332-354
  
• Adi Shamir, Yael Tauman:
  Improved Online/Offline Signature Schemes. 355-367
  

Protocols

• Jun Furukawa, Kazue Sako:
  An Efficient Scheme for Proving a Shuffle. 368-387
  
• Jan Camenisch, Anna Lysyanskaya:
  An Identity Escrow Scheme with Appointed Verifiers. 388-407
  
• Oded Goldreich, Yehuda Lindell:
  Session-Key Generation Using Human Passwords Only. 408-432
  

Cryptoanalysis

• Eric Brier, Christophe Clavier, Jean-Sébastien Coron, David Naccache:
  Cryptanalysis of RSA Signatures with Fixed-Pattern Padding. 433-439
  
• Jovan Dj. Golic:
  Correlation Analysis of the Shrinking Generator. 440-457
  

Application of Groups and Codes

• Jung Hee Cheon:
  Nonlinear Vector Resilient Functions. 458-469
  
• Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongtaek Chee, Choonsik Park:
  New Public Key Cryptosystem Using Finite Non Abelian Groups. 470-485
  
• Eonkyung Lee, Sangjin Lee, Sang Geun Hahn:
  Pseudorandomness from Braid Groups. 486-502
  

Broadcast and Secret Sharling

• Ronald Cramer, Ivan Damgård, Serge Fehr:
  On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. 503-523
  
• Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup:
  Secure and Efficient Asynchronous Broadcast Protocols. 524-541
  

Soundness and Zero-Knowledge

• Silvio Micali, Leonid Reyzin:
  Soundness in the Public-Key Model. 542-565
  
• Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai:
  Robust Non-interactive Zero Knowledge. 566-598