Book Volume 7785 2013

Theory of Cryptography

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


ISBN: 978-3-642-36593-5 (Print) 978-3-642-36594-2 (Online)

Table of contents (41 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-22

    Overcoming Weak Expectations

  3. Chapter

    Pages 23-39

    A Counterexample to the Chain Rule for Conditional HILL Entropy

  4. Chapter

    Pages 40-59

    Hardness Preserving Reductions via Cuckoo Hashing

  5. Chapter

    Pages 60-79

    Concurrent Zero Knowledge in the Bounded Player Model

  6. Chapter

    Pages 80-99

    Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

  7. Chapter

    Pages 100-119

    Succinct Malleable NIZKs and an Application to Compact Shuffles

  8. Chapter

    Pages 120-121

    Encrypted Messages from the Heights of Cryptomania

  9. Chapter

    Pages 122-142

    Attribute-Based Functional Encryption on Lattices

  10. Chapter

    Pages 143-161

    When Homomorphism Becomes a Liability

  11. Chapter

    Pages 162-181

    Garbling XOR Gates “For Free” in the Standard Model

  12. Chapter

    Pages 182-201

    Why “Fiat-Shamir for Proofs” Lacks a Proof

  13. Chapter

    Pages 202-221

    On the (In)security of Fischlin’s Paradigm

  14. Chapter

    Pages 222-242

    Signatures of Correct Computation

  15. Chapter

    Pages 243-262

    A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness

  16. Chapter

    Pages 263-280

    Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities

  17. Chapter

    Pages 281-296

    Feasibility and Completeness of Cryptographic Tasks in the Quantum World

  18. Chapter

    Pages 297-314

    Languages with Efficient Zero-Knowledge PCPs are in SZK

  19. Chapter

    Pages 315-333

    Succinct Non-interactive Arguments via Linear Interactive Proofs

  20. Chapter

    Pages 334-354

    Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments

  21. Chapter

    Pages 355-355

    Secure Computation for Big Data

previous Page of 3