Front matter
1-18
On the (Im)possibility of Obfuscating Programs
Extended Abstract
Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich and Amit Sahai, et al.
19-40
Universally Composable Commitments
Extended Abstract
Ran Canetti and Marc Fischlin
41-62
Revocation and Tracing Schemes for Stateless Receivers
Dalit Naor, Moni Naor and Jeff Lotspiech
63-79
Self Protecting Pirates and Black-Box Traitor Tracing
Aggelos Kiayias and Moti Yung
80-100
Minimal Complete Primitives for Secure Multi-party Computation
Matthias Fitzi, Juan A. Garay, Ueli Maurer and Rafail Ostrovsky
101-118
Robustness for Free in Unconditional Multi-party Computation
Martin Hirt and Ueli Maurer
119-136
Secure Distributed Linear Algebra in a Constant Number of Rounds
Ronald Cramer and Ivan Damgård
137-154
Two-Party Generation of DSA Signatures
Extended Abstract
Philip MacKenzie and Michael K. Reiter
155-170
Oblivious Transfer in the Bounded Storage Model
Yan Zong Ding
171-189
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Yehuda Lindell
190-200
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Robert P. Gallant, Robert J. Lambert and Scott A. Vanstone
201-212
On the Unpredictability of Bits of the Elliptic Curve Diffie-Hellman Scheme
Dan Boneh and Igor E. Shparlinski
213-229
Identity-Based Encryption from the Weil Pairing
Dan Boneh and Matt Franklin
230-238
A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
James Manger
239-259
OAEP Reconsidered
Extended Abstract
Victor Shoup
260-274
RSA-OAEP Is Secure under the RSA Assumption
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointcheval and Jacques Stern
275-291
Simplified OAEP for the RSA and Rabin Functions
Dan Boneh
292-309
Online Ciphers and the Hash-CBC Construction
Mihir Bellare, Alexandra Boldyreva, Lars Knudsen and Chanathip Namprempre
310-331
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Hugo Krawczyk
332-354
Forward-Secure Signatures with Optimal Signing and Verifying
Gene Itkis and Leonid Reyzin
355-367
Improved Online/Offline Signature Schemes
Adi Shamir and Yael Tauman
368-387
An Efficient Scheme for Proving a Shuffle
Jun Furukawa and Kazue Sako
388-407
An Identity Escrow Scheme with Appointed Verifiers
Jan Camenisch and Anna Lysyanskaya
408-432
Session-Key Generation Using Human Passwords Only
Oded Goldreich and Yehuda Lindell
433-439
Cryptanalysis of RSA Signatures with Fixed-Pattern Padding
Eric Brier, Christophe Clavier, Jean-Sébastien Coron and David Naccache
440-457
Correlation Analysis of the Shrinking Generator
Jovan D. Golić
458-469
Nonlinear Vector Resilient Functions
Jung Hee Cheon
470-485
New Public Key Cryptosystem Using Finite Non Abelian Groups
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongtaek Chee and Choonsik Park
486-502
Pseudorandomness from Braid Groups
Eonkyung Lee, Sang Jin Lee and Sang Geun Hahn
503-523
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Ronald Cramer, Ivan Damgård and Serge Fehr
524-541
Secure and Efficient Asynchronous Broadcast Protocols
Extended Abstract
Christian Cachin, Klaus Kursawe, Frank Petzold and Victor Shoup
542-565
Soundness in the Public-Key Model
Silvio Micali and Leonid Reyzin
566-598
Robust Non-interactive Zero Knowledge
Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano and Amit Sahai
Back matter