Abstract is missing.
- Optimal Error Correction Against Computationally Bounded NoiseSilvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson. 1-16 [doi]
- Hardness Amplification of Weakly Verifiable PuzzlesRan Canetti, Shai Halevi, Michael Steiner. 17-33 [doi]
- On Hardness Amplification of One-Way FunctionsHenry Lin, Luca Trevisan, Hoeteck Wee. 34-49 [doi]
- Cryptography in Subgroups of Z::n::Jens Groth. 50-65 [doi]
- Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random GraphsMoni Naor, Asaf Nussboim, Eran Tromer. 66-85 [doi]
- Comparing Two Notions of SimulatabilityDennis Hofheinz, Dominique Unruh. 86-103 [doi]
- Relaxing Environmental Security: Monitored Functionalities and Client-Server ComputationManoj Prabhakaran, Amit Sahai. 104-127 [doi]
- Handling Expected Polynomial-Time Strategies in Simulation-Based Security ProofsJonathan Katz, Yehuda Lindell. 128-149 [doi]
- Adaptively-Secure, Non-interactive Public-Key EncryptionRan Canetti, Shai Halevi, Jonathan Katz. 150-168 [doi]
- Adaptive Security of Symbolic EncryptionDaniele Micciancio, Saurabh Panjwani. 169-187 [doi]
- Chosen-Ciphertext Security of Multiple EncryptionYevgeniy Dodis, Jonathan Katz. 188-209 [doi]
- Public-Key Steganography with Active AttacksMichael Backes, Christian Cachin. 210-226 [doi]
- Upper and Lower Bounds on Black-Box SteganographyNenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell. 227-244 [doi]
- Fair-Zero KnowledgeMatt Lepinski, Silvio Micali, Abhi Shelat. 245-263 [doi]
- How to Securely Outsource Cryptographic ComputationsSusan Hohenberger, Anna Lysyanskaya. 264-282 [doi]
- Secure Computation of the Mean and Related StatisticsEike Kiltz, Gregor Leander, John Malone-Lee. 283-302 [doi]
- Keyword Search and Oblivious Pseudorandom FunctionsMichael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold. 303-324 [doi]
- Evaluating 2-DNF Formulas on CiphertextsDan Boneh, Eu-Jin Goh, Kobbi Nissim. 325-341 [doi]
- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure ComputationRonald Cramer, Ivan Damgård, Yuval Ishai. 342-362 [doi]
- Toward Privacy in Public DatabasesShuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee. 363-385 [doi]
- The Universal Composable Security of Quantum Key DistributionMichael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim. 386-406 [doi]
- Universally Composable Privacy Amplification Against Quantum AdversariesRenato Renner, Robert König. 407-425 [doi]
- A Universally Composable Secure Channel Based on the KEM-DEM FrameworkWaka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto. 426-444 [doi]
- Sufficient Conditions for Collision-Resistant HashingYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky. 445-456 [doi]
- The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic PrimitivesMinh-Huyen Nguyen. 457-475 [doi]
- On the Relationships Between Notions of Simulation-Based SecurityAnupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan. 476-494 [doi]
- A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption SchemesMaria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt, Jorge Luis Villar. 495-509 [doi]
- Further Simplifications in Proactive RSA SignaturesStanislaw Jarecki, Nitesh Saxena. 510-528 [doi]
- Proof of Plaintext Knowledge for the Ajtai-Dwork CryptosystemShafi Goldwasser, Dmitriy Kharchenko. 529-555 [doi]
- Entropic Security and the Encryption of High Entropy MessagesYevgeniy Dodis, Adam Smith. 556-577 [doi]
- Error Correction in the Bounded Storage ModelYan Zong Ding. 578-599 [doi]
- Characterizing Ideal Weighted Threshold Secret SharingAmos Beimel, Tamir Tassa, Enav Weinreb. 600-619 [doi]