TCC 2009 Accepted Papers

  On the (Im)Possibility of Key Dependent Encryption
Iftach Haitner; Thomas Holenstein


  Hierarchical Identity Based Encryption with Polynomially Many Levels
Craig Gentry; Shai Halevi

  Universally Composable Multiparty Computation with Partially Isolated Parties
Ivan Damgard; Jesper Buus Nielsen; Daniel Wichs

  Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Yehuda Lindell; Hila Zarosim

  Composing Quantum Protocols in a Classical Environment
Serge Fehr; Christian Schaffner

  Complete Fairness in Multi-Party Computation Without an Honest Majority
S. Dov Gordon; Jonathan Katz

  How Efficient can Memory Checking be?
Cynthia Dwork; Moni Naor; Guy N. Rothblum ; Vinod Vaikuntanathan

  Chosen-Ciphertext Security via Correlated Products
Alon Rosen; Gil Segev

  An Optimally Fair Coin Toss
Tal Moran; Moni Naor; Gil Segev

  Realistic Failures in Secure Multi-Party Computation
Vassilis Zikas; Sarah Hauser; Ueli Maurer

  Non-Malleable Obfuscation
Ran Canetti; Mayank Varia

  Black-Box Constructions of Two-Party Protocols from One-Way Functions
Rafael Pass; Hoeteck Wee

  Security amplification for interactive cryptographic primitives
Yevgeniy Dodis; Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets

  Oblivious Transfer from Weak Noisy Channels
Jurg Wullschleger

  Towards a Theory of Extractable Functions
Ran Canetti; Ronny Ramzi Dakdouk

  Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security
Robin Kunzler; Jorn Muller-Quade; Dominik Raub

  Proofs of Retrievability via Hardness Amplification
Yevgeniy Dodis; Salil Vadhan; Daniel Wichs

  Composability and On-Line Deniability of Authentication
Yevgeniy Dodis; Jonathan Katz; Asam Smith; Shabsi Walfish

  Secret Sharing and Non-Shannon Information Inequalities
Amos Beimel; Ilan Orlov

  LEGO for Two Party Secure Computation
Jesper Buus Nielsen; Claudio Orlandi
  Simulation-Based Concurrent Non-Malleable Commitments and Decommitments
Rafail Ostrovsky; Giuseppe Persiano; Ivan Visconti

  On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
Iftach Haitner; Alon Rosen; Ronen Shaltiel

  Fairness with an Honest Minority and a Rational Majority
Shien Jin Ong; David Parkes; Alon Rosen; Salil Vadhan

  Weak Verifiable Random Functions
Zvika Brakerski; Shafi Goldwasser; Guy N. Rothblum; Vinod Vaikuntanathan

  Simple, Black-Box Constructions of Adaptively Secure Protocols
Seung Geol Choi; Dana Dachman-Soled; Tal Malkin; Hoeteck Wee

  Simultaneous Hardcore Bits and Cryptography Against Freezing Attacks
Adi Akavia; Shafi Goldwasser; Vinod Vaikuntanathan

  Predicate Privacy in Encryption Systems
Emily Shen; Elaine Shi; Brent Waters

  Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Hemanta Maji; Manoj Prabhakaran; Mike Rosulek

  Truly Rational Secret Sharing
Silvio Micali; abhi shelat

  Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Stanislaw Jarecki; Xiaomin Liu

  Exponential Lower Bounds for a Backtracking Attack against a One-Way Function Based on Expander Graphs
James Cook; Omid Etesami; Rachel Miller; Luca Trevisan

  Authenticated Adversarial Routing
Yair Amir; Paul Bunn; Rafail Ostrovsky

  Secure Arithmetic Computation with No Honest Majority
Yuval Ishai; Manoj Prabhakaran; Amit Sahai