Papers accepted to Crypto 2001

[In alphabetical order by title]

A Chosen Ciphertext Attack On RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized In PKCS #1
James Manger

An Efficient Scheme for Proving a Shuffle
Jun Furukawa, Kazue Sako and Satoshi Obana

An Identity Escrow Scheme with Designated Verifiers
Jan Camenisch and Anna Lysyanskaya

Correlation Analysis of the Shrinking Generator
Jovan Golic

Cryptanalysis of RSA Signatures With Fixed-Pattern Padding
Jean-Sebastien Coron, Eric Brier, Christophe Clavier And David Naccache

Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
R. Gallant, R. Lambert and S. Vanstone

Forward-Secure Signatures with Optimal Signing and Verifying
Gene Itkis and Leonid Reyzin

Hard Core Bits for the Elliptic Curve Diffie--Hellman Secret
Dan Boneh and Igor Shparlinski

Hash-CBC: A General On-Line Cipher And Its Proof Of Security
Mihir Bellare, Alexandra Boldyreva, Lars Knudsen and Chanathip Namprempre

Identity-Based Encryption from the Weil Pairing
Dan Boneh And Matt Franklin

Improved On-Line/Off-Line Signature Schemes
Adi Shamir and Yael Tauman

Minimal Complete Primitives for Secure Multi-Party Computation
Matthias Fitzi, Juan Garay, Ueli Maurer And Rafail Ostrovsky

New Public Key Cryptosystem Using Finite Non Abelian Groups
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongtaek Chee and Choonsik Park

Non-Interactive Zero Knowledge in the Multi-Party Setting
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano and Amit Sahai

Nonlinear Vector Resilient Functions
Jung Hee Cheon

OAEP Reconsidered
Victor Shoup

Oblivious Transfer in the Bounded Storage Model
Yan Zong Ding

On the (Im)Possibility of Obfuscating Programs
Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan and Ke Yang

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Ronald Cramer, Ivan Damgaard and Serge Fehr

Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Yehuda Lindell

Pseudorandomness From Braid Groups
Eonkyung Lee, Sang Jin Lee and Sang Geun Hahn

RSA--OAEP is Secure Under the RSA Assumption
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval and Jacques Stern

Revocation And Tracing Schemes For Stateless Receivers
Jeff Lotspiech, Dalit Naor and Moni Naor

Robustness For Free in Unconditional Multi-Party Computation
Martin Hirt and Ueli Maurer

Secure Distributed Linear Algebra In A Constant Number Of Rounds
Ronald Cramer and Ivan Damgaard

Secure and Efficient Asynchronous Broadcast Protocols
Christian Cachin, Klaus Kursawe, Frank Petzold and Victor Shoup

Security Issues with Practical Realizations of the Ideal Cipher Model
Simon Blake-Wilson, Alfred Menezes, Rene Struik and Yongge Wang

Self Protecting Pirates and Black-Box Traitor Tracing
Aggelos Kiayias and Moti Yung

Session-Key Generation Using Human Passwords Only
Oded Goldreich and Yehuda Lindell

Simplified OAEP for the RSA and Rabin Functions
Dan Boneh

Soundness in the Public-Key Model
Silvio Micali and Leonid Reyzin

The Order Of Encryption And Authentication For Protecting Communications (Or: How Secure Is SSL?)
Hugo Krawczyk

Two-Party Generation Of DSA Signatures
Phil Mackenzie And Mike Reiter

Universally Composable Commitments
Ran Canetti and Marc Fischlin