Theory of cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings / Amit Sahai (ed.).

Overcoming Weak Expectations / Yevgeniy Dodis, Yu Yu -- A Counterexample to the Chain Rule for Conditional HILL Entropy / Stephan Krenn, Krzysztof Pietrzak, Akshay Wadia -- Hardness Preserving Reductions via Cuckoo Hashing / Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor -- Concurrent Zero Knowledge in the Bounded Player Model / Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson -- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model / Ran Canetti, Huijia Lin, Omer Paneth -- Succinct Malleable NIZKs and an Application to Compact Shuffles / Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya -- Encrypted Messages from the Heights of Cryptomania / Craig Gentry -- Attribute-Based Functional Encryption on Lattices / Xavier Boyen -- When Homomorphism Becomes a Liability / Zvika Brakerski -- Garbling XOR Gates "For Free" in the Standard Model / Benny Applebaum -- Why "Fiat-Shamir for Proofs" Lacks a Proof / Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain.

On the (In)security of Fischlin's Paradigm / Prabhanjan Ananth, Raghav Bhaskar, Vipul Goyal, Vanishree Rao -- Signatures of Correct Computation / Charalampos Papamanthou, Elaine Shi, Roberto Tamassia -- A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness / Gilad Asharov, Yehuda Lindell, Tal Rabin -- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities / R. Amzi Jeffs, Mike Rosulek -- Feasibility and Completeness of Cryptographic Tasks in the Quantum World / Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou -- Languages with Efficient Zero-Knowledge PCPs are in SZK / Mohammad Mahmoody, David Xiao -- Succinct Non-interactive Arguments via Linear Interactive Proofs / Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Omer Paneth -- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments / Rafael Pass -- Secure Computation for Big Data / Tal Malkin -- Communication Locality in Secure Multi-party Computation / Elette Boyle, Shafi Goldwasser, Stefano Tessaro.

Distributed Oblivious RAM for Secure Two-Party Computation / Steve Lu, Rafail Ostrovsky -- Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead / Steven Myers, Mona Sergi, abhi shelat -- Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy / Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova -- Limits on the Usefulness of Random Oracles / Iftach Haitner, Eran Omri, Hila Zarosim -- Analyzing Graphs with Node Differential Privacy / Shiva Prasad Kasiviswanathan, Kobbi Nissim, Sofya Raskhodnikova -- Universally Composable Synchronous Computation / Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas -- Multi-Client Non-interactive Verifiable Computation / Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid -- On the Feasibility of Extending Oblivious Transfer / Yehuda Lindell, Hila Zarosim -- Computational Soundness of Coinductive Symbolic Security under Active Attacks / Mohammad Hajiabadi, Bruce M. Kapron.

Revisiting Lower and Upper Bounds for Selective Decommitments / Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro -- On the Circular Security of Bit-Encryption / Ron D. Rothblum -- Cryptographic Hardness of Random Local Functions-Survey / Benny Applebaum -- On the Power of Correlated Randomness in Secure Computation / Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi -- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing / Ivan Damgård, Sarah Zakarias -- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens / Nico Döttling, Thilo Mie, Jörn Müller-Quade, Tobias Nilges -- A Cookbook for Black-Box Separations and a Recipe for UOWHFs / Kfir Barhum, Thomas Holenstein -- Algebraic (Trapdoor) One-Way Functions and Their Applications / Dario Catalano, Dario Fiore, Rosario Gennaro -- Randomness-Dependent Message Security / Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang -- Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks / David Xiao.

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.

Includes bibliographical references and index.

English.