Theory of Cryptography: Sixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings(Security and Cryptology)

TCC 2009, the 6th Theory of Cryptography Conference, was held in San Fr- cisco, CA, USA, March 15–17, 2009. TCC 2009 was sponsored by the Inter- tional Association for Cryptologic Research (IACR) and was organized in - operation with the Applied Crypto Group at Stanford University. The General Chair of the conference was Dan Boneh. The conference received 109 submissions, of which the Program Comm- tee selected 33 for presentation at the conference. These proceedings consist of revised versions of those 33 papers. The revisions were not reviewed, and the authors bear full responsibility for the contents of their papers. The conference program also included two invited talks: “The Di?erential Privacy Frontier,” given by Cynthia Dwork and “Some Recent Progress in Lattice-Based Crypt- raphy,” given by Chris Peikert. I thank the Steering Committee of TCC for entrusting me with the resp- sibility for the TCC 2009 program. I thank the authors of submitted papers for their contributions. The general impression of the Program Committee is that the submissions were of very high quality, and there were many more papers we wanted to accept than we could. The review process was therefore very - warding but the selection was very delicate and challenging. I am grateful for the dedication, thoroughness,and expertise ofthe ProgramCommittee. Obse- ing the way the members of the committee operated makes me as con?dent as possible of the outcome of our selection process.

Table of Contents:
An Optimally Fair Coin Toss.- Complete Fairness in Multi-party Computation without an Honest Majority.- Fairness with an Honest Minority and a Rational Majority.- Purely Rational Secret Sharing (Extended Abstract).- Some Recent Progress in Lattice-Based Cryptography.- Non-malleable Obfuscation.- Simulation-Based Concurrent Non-malleable Commitments and Decommitments.- Proofs of Retrievability via Hardness Amplification.- Security Amplification for Interactive Cryptographic Primitives.- Composability and On-Line Deniability of Authentication.- Authenticated Adversarial Routing.- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.- On the (Im)Possibility of Key Dependent Encryption.- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security.- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.- Realistic Failures in Secure Multi-party Computation.- Secure Arithmetic Computation with No Honest Majority.- Universally Composable Multiparty Computation with Partially Isolated Parties.- Oblivious Transfer from Weak Noisy Channels.- Composing Quantum Protocols in a Classical Environment.- LEGO for Two-Party Secure Computation.- Simple, Black-Box Constructions of Adaptively Secure Protocols.- Black-Box Constructions of Two-Party Protocols from One-Way Functions.- Chosen-Ciphertext Security via Correlated Products.- Hierarchical Identity Based Encryption with Polynomially Many Levels.- Predicate Privacy in Encryption Systems.- Simultaneous Hardcore Bits and Cryptography against Memory Attacks.- The Differential Privacy Frontier (Extended Abstract).- How Efficient Can Memory Checking Be?.- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms.- Secret Sharing and Non-Shannon Information Inequalities.- Weak Verifiable Random Functions.- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection.- Towards a Theory of Extractable Functions.