Theory of Cryptography

1. Front Matter

   PDF

2. Hardness Amplification

   1. Input Locality and Hardness Amplification

      • Andrej Bogdanov, Alon Rosen

      Pages 1-18

   2. General Hardness Amplification of Predicates and Puzzles

      • Thomas Holenstein, Grant Schoenebeck

      Pages 19-36

   3. Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma

      • Stefano Tessaro

      Pages 37-54

3. Invited Talk 1

   1. Dense Model Theorems and Their Applications

      • Luca Trevisan

      Pages 55-57

4. Leakage Resilience

   1. Parallel Repetition for Leakage Resilience Amplification Revisited

      • Abhishek Jain, Krzysztof Pietrzak

      Pages 58-69

   2. Achieving Leakage Resilience through Dual System Encryption

      • Allison Lewko, Yannis Rouselakis, Brent Waters

      Pages 70-88

   3. Signatures Resilient to Continual Leakage on Memory and Computation

      • Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung

      Pages 89-106

   4. After-the-Fact Leakage in Public-Key Encryption

      • Shai Halevi, Huijia Lin

      Pages 107-124

5. Tamper Resilience

   1. One-Time Computable Self-erasing Functions

      • Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

      Pages 125-143

   2. Perfectly Secure Oblivious RAM without Random Oracles

      • Ivan Damgård, Sigurd Meldgaard, Jesper Buus Nielsen

      Pages 144-163

   3. Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token

      • Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade

      Pages 164-181

   4. Correlated-Input Secure Hash Functions

      • Vipul Goyal, Adam O’Neill, Vanishree Rao

      Pages 182-200

6. Encryption

   1. Black-Box Circular-Secure Encryption beyond Affine Functions

      • Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai

      Pages 201-218

   2. Homomorphic Encryption: From Private-Key to Public-Key

      • Ron Rothblum

      Pages 219-234

   3. Identity-Based Encryption Secure against Selective Opening Attack

      • Mihir Bellare, Brent Waters, Scott Yilek

      Pages 235-252

   4. Functional Encryption: Definitions and Challenges

      • Dan Boneh, Amit Sahai, Brent Waters

      Pages 253-273

7. Composable Security

   1. Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs

      • Huijia Lin, Rafael Pass

      Pages 274-292

   2. Round-Optimal Password-Based Authenticated Key Exchange

      • Jonathan Katz, Vinod Vaikuntanathan

      Pages 293-310

   3. Bringing People of Different Beliefs Together to Do UC

      • Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai

      Pages 311-328

This book constitutes the thoroughly refereed proceedings of the 8th Theory of Cryptography Conference, TCC 2011, held in Providence, Rhode Island, USA, in March 2011. The 35 revised full papers are presented together with 2 invited talks and were carefully reviewed and selected from 108 submissions. The papers are organized in topical sections on hardness amplification, leakage resilience, tamper resilience, encryption, composable security, secure computation, privacy, coin tossing and pseudorandomness, black-box constructions and separations, and black box separations.

• computational hardness
• conditional security
• cryptographic attacks
• digital signatures
• functional encryption
• hash functions
• multi-party computation
• oblivious transfer
• provable security
• pseudo-randomness
• quantum computing
• randomness
• zero-knowledge protocols
• algorithm analysis and problem complexity

• Computer Science Department, Technion, Haifa, Israel

  Yuval Ishai

Policies and ethics