6. TCC 2009: San Francisco, CA, USA

• Tal Moran, Moni Naor, Gil Segev:
  An Optimally Fair Coin Toss. 1-18
  
• S. Dov Gordon, Jonathan Katz:
  Complete Fairness in Multi-party Computation without an Honest Majority. 19-35
  
• Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
  Fairness with an Honest Minority and a Rational Majority. 36-53
  
• Silvio Micali, Abhi Shelat:
  Purely Rational Secret Sharing (Extended Abstract). 54-71
  
• Chris Peikert:
  Some Recent Progress in Lattice-Based Cryptography. 72
  
• Ran Canetti, Mayank Varia:
  Non-malleable Obfuscation. 73-90
  
• Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
  Simulation-Based Concurrent Non-malleable Commitments and Decommitments. 91-108
  
• Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
  Proofs of Retrievability via Hardness Amplification. 109-127
  
• Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
  Security Amplification for InteractiveCryptographic Primitives. 128-145
  
• Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish:
  Composability and On-Line Deniability of Authentication. 146-162
  
• Yair Amir, Paul Bunn, Rafail Ostrovsky:
  Authenticated Adversarial Routing. 163-182
  
• Yehuda Lindell, Hila Zarosim:
  Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. 183-201
  
• Iftach Haitner, Thomas Holenstein:
  On the (Im)Possibility of Key Dependent Encryption. 202-219
  
• Iftach Haitner, Alon Rosen, Ronen Shaltiel:
  On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. 220-237
  
• Robin Künzler, Jörn Müller-Quade, Dominik Raub:
  Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. 238-255
  
• Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
  Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. 256-273
  
• Vassilis Zikas, Sarah Hauser, Ueli M. Maurer:
  Realistic Failures in Secure Multi-party Computation. 274-293
  
• Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
  Secure Arithmetic Computation with No Honest Majority. 294-314
  
• Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
  Universally Composable Multiparty Computation with Partially Isolated Parties. 315-331
  
• Jürg Wullschleger:
  Oblivious Transfer from Weak Noisy Channels. 332-349
  
• Serge Fehr, Christian Schaffner:
  Composing Quantum Protocols in a Classical Environment. 350-367
  
• Jesper Buus Nielsen, Claudio Orlandi:
  LEGO for Two-Party Secure Computation. 368-386
  
• Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
  Simple, Black-Box Constructions of Adaptively Secure Protocols. 387-402
  
• Rafael Pass, Hoeteck Wee:
  Black-Box Constructions of Two-Party Protocols from One-Way Functions. 403-418
  
• Alon Rosen, Gil Segev:
  Chosen-Ciphertext Security via Correlated Products. 419-436
  
• Craig Gentry, Shai Halevi:
  Hierarchical Identity Based Encryption with Polynomially Many Levels. 437-456
  
• Emily Shen, Elaine Shi, Brent Waters:
  Predicate Privacy in Encryption Systems. 457-473
  
• Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan:
  Simultaneous Hardcore Bits and Cryptography against Memory Attacks. 474-495
  
• Cynthia Dwork:
  The Differential Privacy Frontier (Extended Abstract). 496-502
  
• Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
  How Efficient Can Memory Checking Be?. 503-520
  
• James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
  Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. 521-538
  
• Amos Beimel, Ilan Orlov:
  Secret Sharing and Non-Shannon Information Inequalities. 539-557
  
• Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan:
  Weak Verifiable Random Functions. 558-576
  
• Stanislaw Jarecki, Xiaomin Liu:
  Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. 577-594
  
• Ran Canetti, Ronny Ramzi Dakdouk:
  Towards a Theory of Extractable Functions. 595-613