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

---

TCC 2006:

New York, NY, USA
Shai Halevi and Tal Rabin (Eds.):
Theory of Cryptography,
Third Theory of Cryptography Conference, TCC 2006,
March 4-7, 2006,
Proceedings.

Sponsored by the International Association for Cryptologic Research
Organized in cooperation with the
Computer Science Department, Columbia University
General and Program co-Chairs
Shai Halevi and Tal Rabin, IBM T.J. Watson Research Center
Preface, by Shai Halevi and Tal Rabin

Program Commitee

Stefan Dziembowski		Warsaw University
Johan Håstad		Royal Institute of Technology
Jonathan Katz		University of Maryland, College Park
Eyal Kushilevitz		Technion Israel Institute of Technology
Yehuda Lindell		Bar-Ilan University
Tal Malkin		Columbia University
Daniele Micciancio		University of California, San Diego
John C. Mitchell		Stanford University
Chanathip Namprempre		Thammasat University
Jesper Buus Nielsen		University of Århus
Manoj Prabhakaran		University of Illinois, Urbana-Champaign
Adam Smith		Weizmann Institute of Science
Luca Trevisan		University of California, Berkeley

TCC Steering Committee

Mihir Bellare		University of California, San Diego
Ivan Damgård		University of Århus
Oded Goldreich		Weizmann Institute of Science
Shafi Goldwasser		MIT
Johan Håstad		Royal Institute of Technology
Russell Impagliazzo		University of California, San Diego
Ueli Maurer		ETH Zurich
Silvio Micali		MIT
Moni Naor		Weizmann Institute of Science
Tatsuaki Okamoto		NTT Labs

External Reviewers

---

Zero-Knowledge

• Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan:
  Concurrent Zero Knowledge Without Complexity Assumptions, (.ps). 1-20
  BibTeX
• Moti Yung, Yunlei Zhao:
  Interactive Zero-Knowledge with Restricted Random Oracles, (.ps). 21-40
  BibTeX
• Ivan Damgård, Nelly Fazio, Antonio Nicolosi:
  Non-interactive Zero-Knowledge from Homomorphic Encryption, (.ps). 41-59
  BibTeX

Primitives

• Adam Bender, Jonathan Katz, Ruggero Morselli:
  Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles, (.ps). 60-79
  BibTeX
• Tatsuaki Okamoto:
  Efficient Blind and Partially Blind Signatures Without Random Oracles, (.ps). 80-99
  BibTeX
• Vladimir Kolesnikov, Charles Rackoff:
  Key Exchange Using Passwords and Long Keys, (.ps). 100-119
  BibTeX
• Dario Catalano, Yevgeniy Dodis, Ivan Visconti:
  Mercurial Commitments: Minimal Assumptions and Efficient Constructions, (.ps). 120-144
  BibTeX

Assumptions and Models

• Chris Peikert, Alon Rosen:
  Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices, (.ps). 145-166
  BibTeX
• Chris Peikert:
  On Error Correction in the Exponent, (.ps). 167-183
  BibTeX
• Yevgeniy Dodis, Prashant Puniya:
  On the Relation Between the Ideal Cipher and the Random Oracle Models, (.ps). 184-206
  BibTeX

The Bounded-Retrieval Model

• Stefan Dziembowski:
  Intrusion-Resilience Via the Bounded-Storage Model, (.ps). 207-224
  BibTeX
• Giovanni Di Crescenzo, Richard J. Lipton, Shabsi Walfish:
  Perfectly Secure Password Protocols in the Bounded Retrieval Model, (.ps). 225-244
  BibTeX

Privacy

• Piotr Indyk, David P. Woodruff:
  Polylogarithmic Private Approximations and Efficient Matching, (.ps). 245-264
  BibTeX
• Cynthia Dwork, Frank McSherry, Kobbi Nissim, Adam Smith:
  Calibrating Noise to Sensitivity in Private Data Analysis, (.ps). 265-284
  BibTeX

Secret Sharing and Multi-party Computation (I)

• Ivan Damgård, Matthias Fitzi, Eike Kiltz, Jesper Buus Nielsen, Tomas Toft:
  Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation, (.ps). 285-304
  BibTeX
• Zuzana Beerliová-Trubíniová, Martin Hirt:
  Efficient Multi-party Computation with Dispute Control, (.ps). 305-328
  BibTeX
• Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan:
  Round-Optimal and Efficient Verifiable Secret Sharing, (.ps). 329-342
  BibTeX

Universally-Composible Security

• Tal Malkin, Ryan Moriarty, Nikolai Yakovenko:
  Generalized Environmental Security from Number Theoretic Assumptions, (.ps). 343-359
  BibTeX
• Anupam Datta, Ante Derek, John C. Mitchell, Ajith Ramanathan, Andre Scedrov:
  Games and the Impossibility of Realizable Ideal Functionality, (.ps). 360-379
  BibTeX
• Ran Canetti, Jonathan Herzog:
  Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols, (.ps). 380-403
  BibTeX
• Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
  Resource Fairness and Composability of Cryptographic Protocols, (.ps). 404-428
  BibTeX

One-Way Functions and Friends

• Hoeteck Wee:
  Finding Pessiland, (.ps). 429-442
  BibTeX
• Thomas Holenstein:
  Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness, (.ps). 443-461
  BibTeX
• Chi-Jen Lu:
  On the Complexity of Parallel Hardness Amplification for One-Way Functions, (.ps). 462-481
  BibTeX

Secret Sharing and Multi-party Computation (II)

• Amos Beimel, Noam Livne:
  On Matroids and Non-ideal Secret Sharing, (.ps). 482-501
  BibTeX
• Chiu-Yuen Koo:
  Secure Computation with Partial Message Loss, (.ps). 502-521
  BibTeX
• Kobbi Nissim, Enav Weinreb:
  Communication Efficient Secure Linear Algebra, (.ps). 522-541
  BibTeX
• Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung:
  Threshold and Proactive Pseudo-Random Permutations, (.ps). 542-560
  BibTeX

Pseudo-Random Functions and Encryption

• Charanjit S. Jutla:
  PRF Domain Extension Using DAGs, (.ps). 561-580
  BibTeX
• Eike Kiltz:
  Chosen-Ciphertext Security from Tag-Based Encryption, (.ps). 581-600
  BibTeX
• Yevgeniy Dodis, Krzysztof Pietrzak, Bartosz Przydatek:
  Separating Sources for Encryption and Secret Sharing, (.ps). 601-616
  BibTeX

Author Index

Copyright © , IACR