TCC 2011:

Yuval Ishai (Eds.):
Theory of Cryptography - 8th Theory of Cryptography Conference - TCC 2011,
TCC 2011,
Providence, RI, USA,
March 28-30, 2011
Proceedings.

• Hardness Amplification
• Input Locality and Hardness Amplification , 1, Alon Rosen , Andrej Bogdanov
  bib info
• General Hardness Amplification of Predicates and Puzzles , 19, Thomas Holenstein , Grant Schoenebeck
  bib info
• Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma , 37, Stefano Tessaro
  bib info
• Invited Talk 1:
• Dense Model Theorems and Their Applications (paper not available), 55, Luca Trevisan , bibinfo
• Leakage Resilience
• Parallel Repetition for Leakage Resilience Amplification Revisited , 58, Krzysztof Pietrzak , Abhishek Jain
  bib info
• Achieving Leakage Resilience Through Dual System Encryption , 70, Brent Waters , Allison Lewko , Yannis Rouselakis
  bib info
• Signatures Resilient to Continual Leakage on Memory and Computation , 89, Moti Yung , Tal Malkin , Isamu Teranishi , Yevgeniy Vahlis
  bib info
• After-the-Fact Leakage in Public-Key Encryption , 107, Shai Halevi , Huijia Lin
  bib info
• Tamper Resilience
• One-Time Computable Self-Erasing Functions , 125, Stefan Dziembowski , Daniel Wichs , Tomasz Kazana
  bib info
• Perfectly Secure Oblivious RAM Without Random Oracles , 144, Ivan Damgård , Jesper Buus Nielsen , Sigurd Meldgaard
  bib info
• Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token , 164, Jörn Müller-Quade , Nico Döttling , Daniel Kraschewski
  bib info
• Correlated-Input Secure Hash Functions , 182, Vipul Goyal , Adam O'Neill , Vanishree Rao
  bib info
• Encryption
• Black-Box Circular-Secure Encryption Beyond Affine Functions , 201, Shafi Goldwasser , Yael Tauman Kalai , Zvika Brakerski
  bib info
• Homomorphic Encryption: from Private-Key to Public-Key , 219, Ron Rothblum
  bib info
• Identity-Based Encryption Secure Against Selective Opening Attack , 235, Mihir Bellare , Brent Waters , Scott Yilek
  bib info
• Functional Encryption: Definitions and Challenges , 253, Dan Boneh , Amit Sahai , Brent Waters
  bib info
• Composable Security
• Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs , 274, Rafael Pass , Huijia Lin
  bib info
• Round-Optimal Password-Based Authenticated Key Exchange , 293, Jonathan Katz , Vinod Vaikuntanathan
  bib info
• Bringing People of Different Beliefs Together to do UC , 311, Vipul Goyal , Amit Sahai , Sanjam Garg , Abhishek Jain
  bib info
• Secure Computation
• Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 329, Benny Pinkas , Yehuda Lindell
  bib info
• Practical Adaptive Oblivious Transfer from Simple Assumptions , 347, Matthew Green , Susan Hohenberger
  bib info
• Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions , 364, Jörn Müller-Quade , Daniel Kraschewski
  bib info
• A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs , 382, Gunnar Kreitz
  bib info
• Privacy
• PCPs and the Hardness of Generating Private Synthetic Data , 400, Salil Vadhan , Jonathan Ullman
  bib info
• Limits of Computational Differential Privacy in the Client/Server Setting , 417, Jonathan Katz , Arkady Yerukhimovich , Adam Groce
  bib info
• Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy , 432, Rafael Pass , Johannes Gehrke , Edward Lui
  bib info
• Coin Tossing and Pseudorandomness
• On the Black-Box Complexity of Optimally-Fair Coin Tossing , 450, Tal Malkin , Yehuda Lindell , Dana Dachman-Soled , Mohammad Mahmoody
  bib info
• Tight Bounds for Classical and Quantum Coin Flipping , 468, Jürg Wullschleger , Esther Hänggi
  bib info
• Exploring the Limits of Common Coins Using Frontier Analysis of Protocols , 486, Manoj Prabhakaran , Mike Rosulek , Hemanta K. Maji , Pichayoot Ouppaphan
  bib info
• Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators , 504, Ali Juma , Josh Bronson , Periklis A. Papakonstantinou
  bib info
• On the Complexity of Non-Adaptively Increasing the Stretch of Pseudorandom Generators , 522, Emanuele Viola , Eric Miles
  bib info
• Invited Talk 2
• Concurrent Security and Non-malleability , 540, Rafael Pass
  bib info
• Black-Box Constructions and Separations
• (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure Against Selective Opening Attacks , 537, David Xiao
• Limits On The Power of Zero-Knowledge Proofs in Cryptographic Constructions , 559, Jonathan Katz , Gil Segev , Zvika Brakerski , Arkady Yerukhimovich
  bib info
• Towards Non-Black-Box Lower Bounds in Cryptography , 579, Rafael Pass , Wei-Lung Dustin Tseng , Muthuramakrishnan Venkitasubramaniam
  bib info
• Black-Box Separations
• On Black-Box Separations among Injective One-Way Functions , 597, Kanta Matsuura , Takahiro Matsuda
  bib info
• Impossibility of Blind Signatures From One-Way Permutations , 615, Jonathan Katz , Dominique Schröder , Arkady Yerukhimovich
  bib info