Theory of Cryptography

1. Secure Computation for Big Data

   • Tal Malkin

   Pages 355-355

2. Communication Locality in Secure Multi-party Computation

   • Elette Boyle, Shafi Goldwasser, Stefano Tessaro

   Pages 356-376

3. Distributed Oblivious RAM for Secure Two-Party Computation

   • Steve Lu, Rafail Ostrovsky

   Pages 377-396

4. Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead

   • Steven Myers, Mona Sergi, abhi shelat

   Pages 397-417

5. Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy

   • Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova, Abhradeep Thakurta

   Pages 418-436

6. Limits on the Usefulness of Random Oracles

   • Iftach Haitner, Eran Omri, Hila Zarosim

   Pages 437-456

7. Analyzing Graphs with Node Differential Privacy

   • Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith

   Pages 457-476

8. Universally Composable Synchronous Computation

   • Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas

   Pages 477-498

9. Multi-Client Non-interactive Verifiable Computation

   • Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid

   Pages 499-518

10. On the Feasibility of Extending Oblivious Transfer

    • Yehuda Lindell, Hila Zarosim

    Pages 519-538

11. Computational Soundness of Coinductive Symbolic Security under Active Attacks

    • Mohammad Hajiabadi, Bruce M. Kapron

    Pages 539-558

12. Revisiting Lower and Upper Bounds for Selective Decommitments

    • Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti

    Pages 559-578

13. On the Circular Security of Bit-Encryption

    • Ron D. Rothblum

    Pages 579-598

14. Cryptographic Hardness of Random Local Functions–Survey

    • Benny Applebaum

    Pages 599-599

15. On the Power of Correlated Randomness in Secure Computation

    • Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky

    Pages 600-620

16. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing

    • Ivan Damgård, Sarah Zakarias

    Pages 621-641

17. Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens

    • Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges

    Pages 642-661

18. A Cookbook for Black-Box Separations and a Recipe for UOWHFs

    • Kfir Barhum, Thomas Holenstein

    Pages 662-679

19. Algebraic (Trapdoor) One-Way Functions and Their Applications

    • Dario Catalano, Dario Fiore, Rosario Gennaro, Konstantinos Vamvourellis

    Pages 680-699

20. Randomness-Dependent Message Security

    • Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang

    Pages 700-720

This book constitutes the thoroughly refereed proceedings of the 10th Theory of Cryptography Conference, TCC 2013, held in Tokyo, Japan, in March 2013. The 36 revised full papers presented were carefully reviewed and selected from 98 submissions. The papers cover topics such as study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones; formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography.

• NIZK
• concurrent zero knowledge
• functional encryption
• multiparty computation
• privacy
• algorithm analysis and problem complexity

• UCLA, Los Angeles, USA

  Amit Sahai

Policies and ethics