Front matter
1-20
Notions of Reducibility between Cryptographic Primitives
Omer Reingold, Luca Trevisan and Salil Vadhan
21-39
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
Ueli Maurer, Renato Renner and Clemens Holenstein
40-57
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
Ran Canetti, Oded Goldreich and Shai Halevi
58-76
Universally Composable Commitments Using Random Oracles
Dennis Hofheinz and Jörn Müller-Quade
77-100
Transformation of Digital Signature Schemes into Designated Confirmer Signature Schemes
Shafi Goldwasser and Erez Waisbard
101-120
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument
Cynthia Dwork, Ronen Shaltiel, Adam Smith and Luca Trevisan
121-132
On the Possibility of One-Message Weak Zero-Knowledge
Boaz Barak and Rafael Pass
133-151
Soundness of Formal Encryption in the Presence of Active Adversaries
Daniele Micciancio and Bogdan Warinschi
152-170
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Jens Groth
171-190
Alternatives to Non-malleability: Definitions, Constructions, and Applications
Philip MacKenzie, Michael K. Reiter and Ke Yang
191-202
A Note on Constant-Round Zero-Knowledge Proofs for NP
Alon Rosen
203-222
Lower Bounds for Concurrent Self Composition
Yehuda Lindell
223-237
Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation
Ronald Cramer and Ivan Damgård
238-257
A Quantitative Approach to Reductions in Secure Computation
Amos Beimel and Tal Malkin
258-277
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali and Tal Rabin
278-296
Physically Observable Cryptography
Silvio Micali and Leonid Reyzin
297-316
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Juan A. Garay, Philip MacKenzie and Ke Yang
317-335
A Universally Composable Mix-Net
Douglas Wikström
336-354
A General Composition Theorem for Secure Reactive Systems
Michael Backes, Birgit Pfitzmann and Michael Waidner
355-373
Unfair Noisy Channels and Oblivious Transfer
Ivan Damgård, Serge Fehr, Kirill Morozov and Louis Salvail
374-393
Computational Collapse of Quantum State with Application to Oblivious Transfer
Claude Crépeau, Paul Dumais, Dominic Mayers and Louis Salvail
394-409
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Iftach Haitner
410-427
Composition of Random Systems: When Two Weak Make One Strong
Ueli Maurer and Krzysztof Pietrzak
428-445
Simpler Session-Key Generation from Short Random Passwords
Minh-Huyen Nguyen and Salil Vadhan
446-472
Constant-Round Oblivious Transfer in the Bounded Storage Model
Yan Zong Ding, Danny Harnik, Alon Rosen and Ronen Shaltiel
473-490
Hierarchical Threshold Secret Sharing
Tamir Tassa
491-504
On Compressing Encrypted Data without the Encryption Key
Mark Johnson, David Wagner and Kannan Ramchandran
505-521
On the Notion of Pseudo-Free Groups
Ronald L. Rivest
Back matter