Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011, Proceedings

Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011, Proceedings

by Yuval Ishai (Editor)


Choose Expedited Shipping at checkout for guaranteed delivery by Friday, March 22

Product Details

ISBN-13: 9783642195709
Publisher: Springer Berlin Heidelberg
Publication date: 05/03/2011
Series: Lecture Notes in Computer Science , #6597
Edition description: 2011
Pages: 631
Product dimensions: 6.10(w) x 9.25(h) x 0.05(d)

Table of Contents

Hardness Amplification

Input Locality and Hardness Amplification Andrej Bogdanov Alan Rosen 1

General Hardness Amplification of Predicates and Puzzles Thomas Holenstein Grant Schoenebeck 19

Security Amplification for the Cascade of Arbitrarily Weak PRPs:Tight Bounds via the Interactive Hardcore Lemma Stefano Tessaro 37

Invited Talk 1

Dense Model Theorems and Their Applications Luca Trevisan 55

Leakage Resilience

Parallel Repetition for Leakage Resilience Amplification Revisited Abhishek Jain Krzysztoj Pietrzak 58

Achieving Leakage Resilience through Dual System Encryption Allison Lewko Yannis Rouselakis Brent Waters 70

Signatures Resilient to Continual Leakage on Memory and Computation Tal Malkin Isarnu Teranishi Yevgeniy Vahlis Moti Yung 89

After-the-Fact Leakage in Public-Key Encryption Shai Hale-vi Huijia Lin 107

Tamper Resilience

One-Time Computable Self-erasing Functions Stefan Dziembowski Tomasz Kazana DanieL Wichs 125

Perfectly Secure Oblivious RAM without Random Oracles Ivan Damgard Sigurd Meldgaard Jesper Buus Nielsen 144

Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token Nico Döttling Daniel Kraschewski Jörn Müller-Quade 164

Correlated-Input Secure Hash Functions Vipul Goyal Adam O'Neill Vanishree Rao 182


Black-Box Circular-Secure Encryption beyond Affine Functions Zvika Brakerski Shafi Goldwasser Yael Tauman Kalai 201

Homomorphic Encryption: From Private-Key to Public-Key Ron Rothblum 219

Identity-Based Encryption Secure against Selective Opening Attack Mihir Bellare Brent Waters Scott Yilek 235

Functional Encryption: Definitions and Challenges Dan Boneh Amit Sahai Brent Waters 253

Composable Security

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs Huijia Lin Rafael Pass 274

Round-Optimal Password-Based Authenticated Key Exchange Jonathan Katz Vinod Vaikuntanathan 293

Bringing People of Different Beliefs Together to Do UC Sanjam Garg Vipul Goyal Abhishek Jain Amit Sahai 311

Secure Computation

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer Yehuda Lindell Benny Pinkas 329

Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green Susan Hohenberger 347

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions Daniel KraschewsKi Jörn Müller-Quade 364

A Zero-One Law for Secure Multi-party Computation with Ternary Outputs Gunnar Kreitz 382


PCPs and the Hardness of Generating Private Synthetic Data Jonathan Ullman Salil Vadhan 400

Limits of Computational Differential Privacy in the Client/Server Setting Adam Groce Jonathan Katz Arkady Yerukhimovich 417

Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy Johannes Gehrke Edward Lui Rafael Pass 432

Coin Tossing and Pseudorandomness

On the Black-Box Complexity of Optimally-Fair Coin Tossing Dana Dachman-Soled Yehuda Lindell Mohammad Mahmoody Tal Malkin 450

Tight Bounds for Classical and Quantum Coin Flipping Esther Hanggi Jürg Wullschleger 468

Exploring the Limits of Common Coins Using Frontier Analysis of Protocols Hemanta K. Maji Pichayoot Ouppaphan Manoj Prabhakaran Mike Rosulek 486

Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators Josh Bronson Ali Juma Periklis A. Papakonstantinou 504

On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators Eric Miles Emanuele Viola 522

Invited Talk 2

Concurrent Security and Non-malleability (Abstract) Rafael Pass 540

Black-Box Constructions and Separations

(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks David Xiao 541

Limits on the power of Zero-Knowledge Proofs in Cryptographic Constructions Zvika Brakerski Jonathan Katz Gil Segev Arkady Yerukhimovich 559

Towards Non-black-Box Lower Bounds in Cryptography Rafael Pass Wei-Lung Dustin Tseng Muthuramakrishnan Venkitasubramaniam 579

Black-Box Separations

On Black-Box Separations among Injective One-Way Functions Takahiro Matsuda Kanta Matsuura 597

Impossibility of Blind Signatures from One-Way Permutations Jonathan Katz Dominique Schröder Arkady Yerukhimovich 615

Author Index 631

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews