Theory of Cryptography

1. Front Matter

   Pages I-XVI

   PDF

2. Obfuscation

   1. Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

      • Zvika Brakerski, Guy N. Rothblum

      Pages 1-25

   2. Obfuscation for Evasive Functions

      • Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai

      Pages 26-51

   3. On Extractability Obfuscation

      • Elette Boyle, Kai-Min Chung, Rafael Pass

      Pages 52-73

3. Applications of Obfuscation

   1. Two-Round Secure MPC from Indistinguishability Obfuscation

      • Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova

      Pages 74-94

   2. Chosen Ciphertext Security via Point Obfuscation

      • Takahiro Matsuda, Goichiro Hanaoka

      Pages 95-120

4. Zero Knowledge

   1. Probabilistically Checkable Proofs of Proximity with Zero-Knowledge

      • Yuval Ishai, Mor Weiss

      Pages 121-145

   2. Achieving Constant Round Leakage-Resilient Zero-Knowledge

      • Omkant Pandey

      Pages 146-166

   3. Statistical Concurrent Non-malleable Zero Knowledge

      • Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti

      Pages 167-191

   4. 4-Round Resettably-Sound Zero Knowledge

      • Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti

      Pages 192-216

5. Black-Box Separations

   1. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

      • Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin

      Pages 217-239

   2. On the Power of Public-Key Encryption in Secure Computation

      • Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran

      Pages 240-264

   3. On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations

      • Takahiro Matsuda

      Pages 265-290

6. Secure Computation

   1. Towards Characterizing Complete Fairness in Secure Two-Party Computation

      • Gilad Asharov

      Pages 291-316

   2. On the Cryptographic Complexity of the Worst Functions

      • Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz

      Pages 317-342

   3. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

      • Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto

      Pages 343-367

   4. One-Sided Adaptively Secure Two-Party Computation

      • Carmit Hazay, Arpita Patra

      Pages 368-393

   5. Multi-linear Secret-Sharing Schemes

      • Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin

      Pages 394-418

   6. Broadcast Amplification

      • Martin Hirt, Ueli Maurer, Pavel Raykov

      Pages 419-439

7. Coding and Cryptographic Applications

   1. Non-malleable Coding against Bit-Wise and Split-State Tampering

      • Mahdi Cheraghchi, Venkatesan Guruswami

      Pages 440-464

This book constitutes the refereed proceedings of the 11th Theory of Cryptography Conference, TCC 2014, held in San Diego, CA, USA, in February 2014. The 30 revised full papers presented were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on obfuscation, applications of obfuscation, zero knowledge, black-box separations, secure computation, coding and cryptographic applications, leakage, encryption, hardware-aided secure protocols, and encryption and signatures.

• coding theory
• malicious adversaries
• oblivious transfer
• public-key encryption
• verifiable random functions
• algorithm analysis and problem complexity

• Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

  Yehuda Lindell

Policies and ethics