Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project

---

TCC 2005: Cambridge, MA, USA

Joe Kilian (Ed.):
Theory of Cryptography, Second Theory of Cryptography Conference,
TCC 2005, Cambridge, MA, USA, February 10-12, 2005,
Proceedings.

Preface, by Joe Kilian

General Chair
Shafi Goldwasser
Massachussetts Institute of Technology, USA,
& Weizmann Institute, Israel
Administrative Assistant: Joanne Talbot Hanley

Program Committee

Boaz Barak		IAS and Princeton, USA
Amos Beimel		Ben-Gurion, Israel
Rosario Gennaro		IBM, USA
Joe Kilian (Chair)		Yianilos Labs, USA
Anna Lysyanskaya		Brown, USA
Tal Malkin		Columbia, USA
Rafail Ostrovsky		UCLA, USA
Erez Petrank		Technion, Israel
Tal Rabin		IBM, USA
Leonid Reyzin		BU, USA
Alon Rosen		MIT, USA
Amit Sahai		UCLA, USA
Louis Salvail		Aarhus University, Denmark

Steering Committee
Mihir Bellare (Chair) (UCSD, USA),
Ivan Damgård (AarhusUniversity, Denmark),
Oded Goldreich (Weizmann Institute, Israel),
Shafi Goldwasser (MIT, USA and Weizmann Institute, Israel),
Johan Håstad (Royal Institute of Technology, Sweden),
Russell Impagliazzo (UCSD, USA),
Ueli Maurer (ETH, Switzerland),
Silvio Micali(MIT, USA),
Moni Naor (Weizmann Institute, Israel),
Tatsuaki Okamoto (NTT, Japan)

External Referees

---

Hardness Amplification and Error Correction

• Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
  Optimal Error Correction Against Computationally Bounded Noise, (.ps). 1-16
  BibTeX
• Ran Canetti, Shai Halevi, Michael Steiner:
  Hardness Amplification of Weakly Verifiable Puzzles, (.ps). 17-33
  BibTeX
• Henry Lin, Luca Trevisan, Hoeteck Wee:
  On Hardness Amplification of One-Way Functions, (.ps). 34-49
  BibTeX

Graphs and Groups

• Jens Groth:
  Cryptography in Subgroups of Z_n, (.ps). 50-65
  BibTeX
• Moni Naor, Asaf Nussboim, Eran Tromer:
  Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs, (.ps). 66-85
  BibTeX

Simulation and Secure Computation

• Dennis Hofheinz, Dominique Unruh:
  Comparing Two Notions of Simulatability, (.ps). 86-103
  BibTeX
• Manoj Prabhakaran, Amit Sahai:
  Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation, (.ps). 104-127
  BibTeX
• Jonathan Katz, Yehuda Lindell:
  Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs, (.ps). 128-149
  BibTeX

Security of Encryption

• Ran Canetti, Shai Halevi, Jonathan Katz:
  Adaptively-Secure, Non-interactive Public-Key Encryption, (.ps). 150-168
  BibTeX
• Daniele Micciancio, Saurabh Panjwani:
  Adaptive Security of Symbolic Encryption, (.ps). 169-187
  BibTeX
• Yevgeniy Dodis, Jonathan Katz:
  Chosen-Ciphertext Security of Multiple Encryption, (.ps). 188-209
  BibTeX

Steganography and Zero Knowledge

• Michael Backes, Christian Cachin:
  Public-Key Steganography with Active Attacks, (.ps). 210-226
  BibTeX
• Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell:
  Upper and Lower Bounds on Black-Box Steganography, (.ps). 227-244
  BibTeX
• Matt Lepinski, Silvio Micali, Abhi Shelat:
  Fair-Zero Knowledge, (.ps). 245-263
  BibTeX

Secure Computation I

• Susan Hohenberger, Anna Lysyanskaya:
  How to Securely Outsource Cryptographic Computations, (.ps). 264-282
  BibTeX
• Eike Kiltz, Gregor Leander, John Malone-Lee:
  Secure Computation of the Mean and Related Statistics, (.ps). 283-302
  BibTeX
• Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold:
  Keyword Search and Oblivious Pseudorandom Functions, (.ps). 303-324
  BibTeX

Secure Computation II

• Dan Boneh, Eu-Jin Goh, Kobbi Nissim:
  Evaluating 2-DNF Formulas on Ciphertexts, (.ps). 325-341
  BibTeX
• Ronald Cramer, Ivan Damgård, Yuval Ishai:
  Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation, (.ps). 342-362
  BibTeX
• Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee:
  Toward Privacy in Public Databases, (.ps). 363-385
  BibTeX

Quantum Cryptography and Universal Composability

• Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim:
  The Universal Composable Security of Quantum Key Distribution, (.ps). 386-406
  BibTeX
• Renato Renner, Robert König:
  Universally Composable Privacy Amplification Against Quantum Adversaries, (.ps). 407-425
  BibTeX
• Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto:
  A Universally Composable Secure Channel Based on the KEM-DEM Framework, (.ps). 426-444
  BibTeX

Cryptographic Primitives and Security

• Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
  Sufficient Conditions for Collision-Resistant Hashing, (.ps). 445-456
  BibTeX
• Minh-Huyen Nguyen:
  The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives, (.ps). 457-475
  BibTeX
• Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan:
  On the Relationships Between Notions of Simulation-Based Security, (.ps). 476-494
  BibTeX

Encryption and Signatures

• Maria Isabel Gonzalez Vasco, Consuelo Martínez, Rainer Steinwandt, Jorge Luis Villar:
  A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes, (.ps). 495-509
  BibTeX
• Stanislaw Jarecki, Nitesh Saxena:
  Further Simplifications in Proactive RSA Signatures, (.ps). 510-528
  BibTeX
• Shafi Goldwasser, Dmitriy Kharchenko:
  Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem, (.ps). 529-555
  BibTeX

Information Theoretic Cryptography

• Yevgeniy Dodis, Adam Smith:
  Entropic Security and the Encryption of High Entropy Messages, (.ps). 556-577
  BibTeX
• Yan Zong Ding:
  Error Correction in the Bounded Storage Model, (.ps). 578-599
  BibTeX
• Amos Beimel, Tamir Tassa, Enav Weinreb:
  Characterizing Ideal Weighted Threshold Secret Sharing, (.ps). 600-619
  BibTeX

Author Index

Copyright © , IACR