8. TCC 2011: Providence, RI, USA

Yuval Ishai (Ed.): Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6597 Springer 2011, ISBN 978-3-642-19570-9

Hardness Amplification

Andrej Bogdanov, Alon Rosen:
Input Locality and Hardness Amplification. 1-18
Thomas Holenstein, Grant Schoenebeck:
General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). 19-36
Stefano Tessaro:
Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma. 37-54

Invited Talk 1

Luca Trevisan:
Dense Model Theorems and Their Applications. 55-57

Leakage Resilience

Abhishek Jain, Krzysztof Pietrzak:
Parallel Repetition for Leakage Resilience Amplification Revisited. 58-69
Allison B. Lewko, Yannis Rouselakis, Brent Waters:
Achieving Leakage Resilience through Dual System Encryption. 70-88
Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung:
Signatures Resilient to Continual Leakage on Memory and Computation. 89-106
Shai Halevi, Huijia Lin:
After-the-Fact Leakage in Public-Key Encryption. 107-124

Tamper Resilience

Stefan Dziembowski, Tomasz Kazana, Daniel Wichs:
One-Time Computable Self-erasing Functions. 125-143
Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen:
Perfectly Secure Oblivious RAM without Random Oracles. 144-163
Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade:
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token. 164-181
Vipul Goyal, Adam O'Neill, Vanishree Rao:
Correlated-Input Secure Hash Functions. 182-200

Encryption

Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai:
Black-Box Circular-Secure Encryption beyond Affine Functions. 201-218
Ron Rothblum:
Homomorphic Encryption: From Private-Key to Public-Key. 219-234
Mihir Bellare, Brent Waters, Scott Yilek:
Identity-Based Encryption Secure against Selective Opening Attack. 235-252
Dan Boneh, Amit Sahai, Brent Waters:
Functional Encryption: Definitions and Challenges. 253-273

Composable Security

Huijia Lin, Rafael Pass:
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. 274-292
Jonathan Katz, Vinod Vaikuntanathan:
Round-Optimal Password-Based Authenticated Key Exchange. 293-310
Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
Bringing People of Different Beliefs Together to Do UC. 311-328

Secure Computation

Yehuda Lindell, Benny Pinkas:
Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer. 329-346
Matthew Green, Susan Hohenberger:
Practical Adaptive Oblivious Transfer from Simple Assumptions. 347-363
Daniel Kraschewski, Jörn Müller-Quade:
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions. 364-381
Gunnar Kreitz:
A Zero-One Law for Secure Multi-party Computation with Ternary Outputs. 382-399

Privacy

Jonathan Ullman, Salil P. Vadhan:
PCPs and the Hardness of Generating Private Synthetic Data. 400-416
Adam Groce, Jonathan Katz, Arkady Yerukhimovich:
Limits of Computational Differential Privacy in the Client/Server Setting. 417-431
Johannes Gehrke, Edward Lui, Rafael Pass:
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy. 432-449

Coin Tossing and Pseudorandomness

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin:
On the Black-Box Complexity of Optimally-Fair Coin Tossing. 450-467
Esther Hänggi, Jürg Wullschleger:
Tight Bounds for Classical and Quantum Coin Flipping. 468-485
Hemanta K. Maji, Pichayoot Ouppaphan, Manoj Prabhakaran, Mike Rosulek:
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols. 486-503
Josh Bronson, Ali Juma, Periklis A. Papakonstantinou:
Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. 504-521
Eric Miles, Emanuele Viola:
On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. 522-539

Invited Talk 2

Rafael Pass:
Concurrent Security and Non-malleability. 540

Black-Box Constructions and Separations

David Xiao:
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks. 541-558
Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich:
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. 559-578
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Towards Non-Black-Box Lower Bounds in Cryptography. 579-596

Black-Box Separations

Takahiro Matsuda, Kanta Matsuura:
On Black-Box Separations among Injective One-Way Functions. 597-614
Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich:
Impossibility of Blind Signatures from One-Way Permutations. 615-629

Last update Fri May 25 08:43:01 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page