Theory of Cryptography

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Computing on Authenticated Data
3. Altmetric Badge
   Chapter 2 Identifying Cheaters without an Honest Majority
4. Altmetric Badge
   Chapter 3 On the Security of the “Free-XOR” Technique
5. Altmetric Badge
   Chapter 4 Secure Two-Party Computation with Low Communication
6. Altmetric Badge
   Chapter 5 Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
7. Altmetric Badge
   Chapter 6 Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
8. Altmetric Badge
   Chapter 7 On the Instantiability of Hash-and-Sign RSA Signatures
9. Altmetric Badge
   Chapter 8 Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
10. Altmetric Badge
    Chapter 9 On Efficient Zero-Knowledge PCPs
11. Altmetric Badge
    Chapter 10 Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
12. Altmetric Badge
    Chapter 11 Point Obfuscation and 3-Round Zero-Knowledge
13. Altmetric Badge
    Chapter 12 Confidentiality and Integrity: A Constructive Perspective
14. Altmetric Badge
    Chapter 13 Leakage-Resilient Circuits without Computational Assumptions
15. Altmetric Badge
    Chapter 14 A Parallel Repetition Theorem for Leakage Resilience
16. Altmetric Badge
    Chapter 15 Leakage-Tolerant Interactive Protocols
17. Altmetric Badge
    Chapter 16 On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
18. Altmetric Badge
    Chapter 17 Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
19. Altmetric Badge
    Chapter 18 Lower Bounds in Differential Privacy
20. Altmetric Badge
    Chapter 19 Iterative Constructions and Private Data Release
21. Altmetric Badge
    Chapter 20 From Non-adaptive to Adaptive Pseudorandom Functions
22. Altmetric Badge
    Chapter 21 Hardness Preserving Constructions of Pseudorandom Functions
23. Altmetric Badge
    Chapter 22 Computational Extractors and Pseudorandomness
24. Altmetric Badge
    Chapter 23 Functional Re-encryption and Collusion-Resistant Obfuscation
25. Altmetric Badge
    Chapter 24 How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
26. Altmetric Badge
    Chapter 25 On Black-Box Reductions between Predicate Encryption Schemes
27. Altmetric Badge
    Chapter 26 Lossy Functions Do Not Amplify Well
28. Altmetric Badge
    Chapter 27 Counterexamples to Hardness Amplification beyond Negligible
29. Altmetric Badge
    Chapter 28 Resettable Statistical Zero Knowledge
30. Altmetric Badge
    Chapter 29 The Knowledge Tightness of Parallel Zero-Knowledge
31. Altmetric Badge
    Chapter 30 Simultaneously Resettable Arguments of Knowledge
32. Altmetric Badge
    Chapter 31 Subspace LWE
33. Altmetric Badge
    Chapter 32 Bounded-Collusion IBE from Key Homomorphism
34. Altmetric Badge
    Chapter 33 A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
35. Altmetric Badge
    Chapter 34 A Dichotomy for Local Small-Bias Generators
36. Altmetric Badge
    Chapter 35 Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources
37. Altmetric Badge
    Chapter 36 Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations