Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013. Proceedings

Front Matter....Pages -
Overcoming Weak Expectations....Pages 1-22
A Counterexample to the Chain Rule for Conditional HILL Entropy....Pages 23-39
Hardness Preserving Reductions via Cuckoo Hashing....Pages 40-59
Concurrent Zero Knowledge in the Bounded Player Model....Pages 60-79
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model....Pages 80-99
Succinct Malleable NIZKs and an Application to Compact Shuffles....Pages 100-119
Encrypted Messages from the Heights of Cryptomania....Pages 120-121
Attribute-Based Functional Encryption on Lattices....Pages 122-142
When Homomorphism Becomes a Liability....Pages 143-161
Garbling XOR Gates “For Free” in the Standard Model....Pages 162-181
Why “Fiat-Shamir for Proofs” Lacks a Proof....Pages 182-201
On the (In)security of Fischlin’s Paradigm....Pages 202-221
Signatures of Correct Computation....Pages 222-242
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness....Pages 243-262
Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities....Pages 263-280
Feasibility and Completeness of Cryptographic Tasks in the Quantum World....Pages 281-296
Languages with Efficient Zero-Knowledge PCPs are in SZK....Pages 297-314
Succinct Non-interactive Arguments via Linear Interactive Proofs....Pages 315-333
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments....Pages 334-354
Secure Computation for Big Data....Pages 355-355
Communication Locality in Secure Multi-party Computation....Pages 356-376
Distributed Oblivious RAM for Secure Two-Party Computation....Pages 377-396
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead....Pages 397-417
Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy....Pages 418-436
Limits on the Usefulness of Random Oracles....Pages 437-456
Analyzing Graphs with Node Differential Privacy....Pages 457-476
Universally Composable Synchronous Computation....Pages 477-498
Multi-Client Non-interactive Verifiable Computation....Pages 499-518
On the Feasibility of Extending Oblivious Transfer....Pages 519-538
Computational Soundness of Coinductive Symbolic Security under Active Attacks....Pages 539-558
Revisiting Lower and Upper Bounds for Selective Decommitments....Pages 559-578
On the Circular Security of Bit-Encryption....Pages 579-598
Cryptographic Hardness of Random Local Functions–Survey....Pages 599-599
On the Power of Correlated Randomness in Secure Computation....Pages 600-620
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing....Pages 621-641
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens....Pages 642-661
A Cookbook for Black-Box Separations and a Recipe for UOWHFs....Pages 662-679
Algebraic (Trapdoor) One-Way Functions and Their Applications....Pages 680-699
Randomness-Dependent Message Security....Pages 700-720
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks ....Pages 721-722
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs....Pages E1-E1
Back Matter....Pages -