Theory of Cryptography

1. Front Matter

   PDF

2. Parallel Repetition

   1. An Efficient Parallel Repetition Theorem

      • Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak

      Pages 1-18

   2. Parallel Repetition Theorems for Interactive Arguments

      • Kai-Min Chung, Feng-Hao Liu

      Pages 19-36

   3. Almost Optimal Bounds for Direct Product Threshold Theorem

      • Charanjit S. Jutla

      Pages 37-51

3. Obfuscation

   1. On Symmetric Encryption and Point Obfuscation

      • Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs

      Pages 52-71

   2. Obfuscation of Hyperplane Membership

      • Ran Canetti, Guy N. Rothblum, Mayank Varia

      Pages 72-89

4. Invited Talk

   1. Secure Computation and Its Diverse Applications

      • Yuval Ishai

      Pages 90-90

5. Multiparty Computation

   1. On Complete Primitives for Fairness

      • Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai

      Pages 91-108

   2. On the Necessary and Sufficient Assumptions for UC Computation

      • Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi

      Pages 109-127

   3. From Passive to Covert Security at Low Cost

      • Ivan Damgård, Martin Geisler, Jesper Buus Nielsen

      Pages 128-145

6. CCA Security

   1. A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems

      • Ronald Cramer, Dennis Hofheinz, Eike Kiltz

      Pages 146-164

   2. Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs

      • Yevgeniy Vahlis

      Pages 165-182

7. Threshold Cryptography and Secret Sharing

   1. Efficient, Robust and Constant-Round Distributed RSA Key Generation

      • Ivan Damgård, Gert Læssøe Mikkelsen

      Pages 183-200

   2. Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

      • Rikke Bendlin, Ivan Damgård

      Pages 201-218

   3. Ideal Hierarchical Secret Sharing Schemes

      • Oriol Farràs, Carles Padró

      Pages 219-236

8. Symmetric Cryptography

   1. A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch

      • Ueli Maurer, Stefano Tessaro

      Pages 237-254

   2. On Related-Secret Pseudorandomness

      • David Goldenberg, Moses Liskov

      Pages 255-272

   3. A Domain Extender for the Ideal Cipher

      • Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin

      Pages 273-289

   4. Delayed-Key Message Authentication for Streams

      • Marc Fischlin, Anja Lehmann

      Pages 290-307

9. Key-Leakage and Tamper-Resistance

   1. Founding Cryptography on Tamper-Proof Hardware Tokens

      • Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia

      Pages 308-326

This book constitutes the refereed proceedings of the Seventh Theory of Cryptography Conference, TCC 2010, held in Zurich, Switzerland, February 9-11, 2010. The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 100 submissions.The papers are organized in topical sections on parallel repetition, obfuscation, multiparty computation, CCA security, threshold cryptography and secret sharing, symmetric cryptography, key-leakage and tamper-resistance, rationality and privacy, public-key encryption, and zero-knowledge.

• Information
• RSA
• authentication
• communication
• complexity
• cryptographic algorithms
• cryptography
• cryptology
• game theory
• mathematical logic
• obfuscation
• public key
• security
• signatures
• algorithm analysis and problem complexity

• Computer Science & Engineering Department, University of California,, San Diego, USA

  Daniele Micciancio

Policies and ethics