Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Concurrent Zero Knowledge Without Complexity Assumptions
3. Altmetric Badge
   Chapter 2 Interactive Zero-Knowledge with Restricted Random Oracles
4. Altmetric Badge
   Chapter 3 Non-interactive Zero-Knowledge from Homomorphic Encryption
5. Altmetric Badge
   Chapter 4 Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles
6. Altmetric Badge
   Chapter 5 Efficient Blind and Partially Blind Signatures Without Random Oracles
7. Altmetric Badge
   Chapter 6 Key Exchange Using Passwords and Long Keys
8. Altmetric Badge
   Chapter 7 Mercurial Commitments: Minimal Assumptions and Efficient Constructions
9. Altmetric Badge
   Chapter 8 Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
10. Altmetric Badge
    Chapter 9 On Error Correction in the Exponent
11. Altmetric Badge
    Chapter 10 On the Relation Between the Ideal Cipher and the Random Oracle Models
12. Altmetric Badge
    Chapter 11 Intrusion-Resilience Via the Bounded-Storage Model
13. Altmetric Badge
    Chapter 12 Perfectly Secure Password Protocols in the Bounded Retrieval Model
14. Altmetric Badge
    Chapter 13 Polylogarithmic Private Approximations and Efficient Matching
15. Altmetric Badge
    Chapter 14 Theory of Cryptography
16. Altmetric Badge
    Chapter 15 Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation
17. Altmetric Badge
    Chapter 16 Efficient Multi-party Computation with Dispute Control
18. Altmetric Badge
    Chapter 17 Round-Optimal and Efficient Verifiable Secret Sharing
19. Altmetric Badge
    Chapter 18 Generalized Environmental Security from Number Theoretic Assumptions
20. Altmetric Badge
    Chapter 19 Games and the Impossibility of Realizable Ideal Functionality
21. Altmetric Badge
    Chapter 20 Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols
22. Altmetric Badge
    Chapter 21 Resource Fairness and Composability of Cryptographic Protocols
23. Altmetric Badge
    Chapter 22 Finding Pessiland
24. Altmetric Badge
    Chapter 23 Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
25. Altmetric Badge
    Chapter 24 On the Complexity of Parallel Hardness Amplification for One-Way Functions
26. Altmetric Badge
    Chapter 25 On Matroids and Non-ideal Secret Sharing
27. Altmetric Badge
    Chapter 26 Secure Computation with Partial Message Loss
28. Altmetric Badge
    Chapter 27 Communication Efficient Secure Linear Algebra
29. Altmetric Badge
    Chapter 28 Threshold and Proactive Pseudo-Random Permutations
30. Altmetric Badge
    Chapter 29 PRF Domain Extension Using DAGs
31. Altmetric Badge
    Chapter 30 Chosen-Ciphertext Security from Tag-Based Encryption
32. Altmetric Badge
    Chapter 31 Separating Sources for Encryption and Secret Sharing
33. Altmetric Badge
    Chapter 32 Erratum to: Theory of Cryptography