Abstract is missing.
- Notions of Reducibility between Cryptographic PrimitivesOmer Reingold, Luca Trevisan, Salil P. Vadhan. 1-20 [doi]
- Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle MethodologyUeli M. Maurer, Renato Renner, Clemens Holenstein. 21-39 [doi]
- On the Random-Oracle Methodology as Applied to Length-Restricted Signature SchemesRan Canetti, Oded Goldreich, Shai Halevi. 40-57 [doi]
- Universally Composable Commitments Using Random OraclesDennis Hofheinz, Jörn Müller-Quade. 58-76 [doi]
- Transformation of Digital Signature Schemes into Designated Confirmer Signature SchemesShafi Goldwasser, Erez Waisbard. 77-100 [doi]
- List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge ArgumentCynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan. 101-120 [doi]
- On the Possibility of One-Message Weak Zero-KnowledgeBoaz Barak, Rafael Pass. 121-132 [doi]
- Soundness of Formal Encryption in the Presence of Active AdversariesDaniele Micciancio, Bogdan Warinschi. 133-151 [doi]
- Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure CryptosystemsJens Groth. 152-170 [doi]
- Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract)Philip D. MacKenzie, Michael K. Reiter, Ke Yang. 171-190 [doi]
- A Note on Constant-Round Zero-Knowledge Proofs for NPAlon Rosen. 191-202 [doi]
- Lower Bounds for Concurrent Self CompositionYehuda Lindell. 203-222 [doi]
- Secret-Key Zero-Knowlegde and Non-interactive Verifiable ExponentiationRonald Cramer, Ivan Damgård. 223-237 [doi]
- A Quantitative Approach to Reductions in Secure ComputationAmos Beimel, Tal Malkin. 238-257 [doi]
- Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware TamperingRosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin. 258-277 [doi]
- Physically Observable Cryptography (Extended Abstract)Silvio Micali, Leonid Reyzin. 278-296 [doi]
- Efficient and Universally Composable Committed Oblivious Transfer and ApplicationsJuan A. Garay. 297-316 [doi]
- A Universally Composable Mix-NetDouglas Wikström. 317-335 [doi]
- A General Composition Theorem for Secure Reactive SystemsMichael Backes, Birgit Pfitzmann, Michael Waidner. 336-354 [doi]
- Unfair Noisy Channels and Oblivious TransferIvan Damgård, Serge Fehr, Kirill Morozov, Louis Salvail. 355-373 [doi]
- Computational Collapse of Quantum State with Application to Oblivious TransferClaude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail. 374-393 [doi]
- Implementing Oblivious Transfer Using Collection of Dense Trapdoor PermutationsIftach Haitner. 394-409 [doi]
- Composition of Random Systems: When Two Weak Make One StrongUeli M. Maurer, Krzysztof Pietrzak. 410-427 [doi]
- Simpler Session-Key Generation from Short Random PasswordsMinh-Huyen Nguyen, Salil P. Vadhan. 428-445 [doi]
- Constant-Round Oblivious Transfer in the Bounded Storage ModelYan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel. 446-472 [doi]
- Hierarchical Threshold Secret SharingTamir Tassa. 473-490 [doi]
- On Compressing Encrypted Data without the Encryption KeyMark Johnson, David Wagner, Kannan Ramchandran. 491-504 [doi]
- On the Notion of Pseudo-Free GroupsRonald L. Rivest. 505-521 [doi]