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

---

TCC 2007:

Amsterdam, The Netherlands
Salil P. Vadhan (Ed.):
Fourth Theory of Cryptography Conference,
February 21-24, 2007
TCC 2007,
Proceedings

Sponsored by the International Association for Cryptologic Research
Organized in cooperation with the
Cryptology and Information Security Group at CWI, Amsterdam
Mathematical Institute, Leiden University
DIAMANT, the Dutch national mathematics cluster for discrete interactive and algorithmic algebra and number theory.

General Chair
Ronald Cramer

Program Chair
Salil P. Vadhan

Preface, by Salil P. Vadhan

Program Commitee

Mihir Bellare	University of California, San Diego
Ran Canetti	IBM T.J. Watson Research Center
Ivan Damgård	University of Aarhus
Cynthia Dwork	Microsoft Research
Serge Fehr	CWI Amsterdam
Yuval Ishai	The Technion
Jonathan Katz	University of Maryland
Rafael Pass	MIT and Cornell University
Oded Regev	Tel-Aviv University
Omer Reingold	Weizmann Institute of Science
Ronen Shaltiel	University of Haifa
Victor Shoup	New York University
Yael Tauman Kalai	MIT and Weizmann Institute of Science
Salil Vadhan (chair)	Harvard University
Bogdan Warinschi	INRIA-Lorraine

TCC Steering Committee

Mihir Bellare	University of California, San Diego
Ivan Damgård	University of Aarhus
Oded Goldreich (chair)	Weizmann Institute of Science
Shafi Goldwasser	MIT and Weizmann Institute of Science
Johan Håstad	Royal Institute of Technology
Russell Impagliazzo	University of California, San Diego
Ueli Maurer	ETH Zürich
Silvio Micali	Massachusetts Institute of Technology
Moni Naor	Weizmann Institute of Science
Tatsuaki Okamoto	NTT Laboratories

External reviewers

Encryption I

• Carl Bosley, Yevgeniy Dodis:
  Does Privacy Require True Randomness?, (.ps) 1-20
  BibTeX
• Saurabh Panjwani:
  Tackling Adaptive Corruptions in Multicast Encryption Protocols 21-40
  BibTeX

Universally Composable Security

• Jörn Müller-Quade, Dominique Unruh:
  Long-Term Security and Universal Composability, (.ps) 41-60
  BibTeX
• Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
  Universally Composable Security with Global Setup, (.ps) 61-85
  BibTeX

Arguments and Zero Knowledge

• Krzysztof Pietrzak, Douglas Wikström:
  Parallel Repetition of Computationally Sound Protocols Revisited, (.ps) 86-102
  BibTeX
• Hoeteck Wee:
  Lower Bounds for Non-interactive Zero-Knowledge, (.ps) 103-117
  BibTeX
• Masayuki Abe, Serge Fehr:
  Perfect NIZK with Adaptive Soundness, (.ps) 118-136
  BibTeX

Notions of Security

• Yonatan Aumann, Yehuda Lindell:
  Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries, (.ps) 137-156
  BibTeX
• Michael Backes, Jörn Müller-Quade, Dominique Unruh:
  On the Necessity of Rewinding in Secure Multiparty Computation, (.ps) 157-173
  BibTeX
• Oded Goldreich:
  On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits, (.ps) 174-193
  BibTeX

Obfuscation

• Shafi Goldwasser, Guy N. Rothblum:
  On Best-Possible Obfuscation, (.ps) 194-213
  BibTeX
• Dennis Hofheinz, John Malone-Lee, Martijn Stam:
  Obfuscation for Cryptographic Purposes, (.ps) 214-232
  BibTeX
• Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
  Securely Obfuscating Re-encryption, (.ps) 233-252
  BibTeX

Secret Sharing and Multiparty Computation

• Amos Beimel, Matthew K. Franklin:
  Weakly-Private Secret Sharing Schemes, (.ps) 253-272
  BibTeX
• Jaume Martí-Farré, Carles Padró:
  On Secret Sharing Schemes, Matroids and Polymatroids, (.ps) 273-290
  BibTeX
• Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin:
  Secure Linear Algebra Using Linearly Recurrent Sequences, (.ps) 291-310
  BibTeX
• Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, S. Harsha Vardhan:
  Towards Optimal and Efficient Perfectly Secure Message Transmission, (.ps) 311-322
  BibTeX

Signatures and Watermarking

• Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell:
  Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions, (.ps) 323-341
  BibTeX
• Douglas Wikström:
  Designated Confirmer Signatures Revisited, (.ps) 342-361
  BibTeX
• Nicholas Hopper, David Molnar, David Wagner:
  From Weak to Strong Watermarking, (.ps) 362-382
  BibTeX

Private Approximation and Black-Box Reductions

• Amos Beimel, Renen Hallak, Kobbi Nissim:
  Private Approximation of Clustering and Vertex Cover, (.ps) 383-403
  BibTeX
• Remo Meier, Bartosz Przydatek, Jürg Wullschleger:
  Robuster Combiners for Oblivious Transfer, (.ps) 404-418
  BibTeX
• Hoeteck Wee:
  One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments, (.ps) 419-433
  BibTeX
• Yael Gertner, Tal Malkin, Steven Myers:
  Towards a Separation of Semantic and CCA Security for Public Key Encryption, (.ps) 434-455
  BibTeX

Key Establishment

• Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, Renato Renner:
  Unifying Classical and Quantum Key Distillation, (.ps) 456-478
  BibTeX
• David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish:
  Intrusion-Resilient Key Exchange in the Bounded Retrieval Model, (.ps) 479-498
  BibTeX
• Michel Abdalla, Jens-Matthias Bohli, Maria Isabel Gonzalez Vasco, Rainer Steinwandt:
  (Password) Authenticated Key Establishment: From 2-Party to Group, (.ps) 499-514
  BibTeX

Encryption II

• Melissa Chase:
  Multi-authority Attribute Based Encryption, (.ps) 515-534
  BibTeX
• Dan Boneh, Brent Waters:
  Conjunctive, Subset, and Range Queries on Encrypted Data, (.ps) 535-554
  BibTeX
• Ben Adida, Douglas Wikström:
  How to Shuffle in Public, (.ps) 555-574
  BibTeX
• Yuval Ishai, Anat Paskin:
  Evaluating Branching Programs on Encrypted Data, (.ps) 575-594
  BibTeX

Author Index

Copyright © , IACR