Cryptography for Computer Scientists II
2012/13


Material covered:
  1. One-way functions and weak one-way functions (Chapter 1 of [Hol] without Section 1.3)
  2. Pseudorandom Generators (Chapter 3 of [Hol])
  3. Goldreich-Levin Theorem and PRGs from one-way permutations (Chapter 4 and Chapter 5 of [Hol])
  4. Hardness Amplification, Yao XOR Lemma (Section 19.1 of [AB])
  5. Zero-Knowledge and Non-Interactive Zero Knowledge (Chapter 4 of [Gol], without Section 4.6,4.7,4.8,4.9 and 4.11)
  6. CCA security from NIZKs (Lecture 56 and 7 of [Kat])
  7. Cramer-Shoup Cryptosystem (Lectures 9 and 10 of [Kat])
  8. Pairing-based cryptography (Lecture 25 of [CR])
  9. Multiparty Computation Protocols ([BGW], only passive security)

Bibliography: