Cryptography for Computer Scientists II

2012/13

**Lecturer**: Stefan Dziembowski

**TA**: Maciej Skórski

**Material covered:**

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

**Bibliography:**

[AB] S. Arora and B. Barak

**Computational Complexity: A Modern Approach**[CR ] R. Canetti and R. Rivest

**Selected Topics in Cryptography (Lecture Notes)**[Gol] O. Goldreich

**Foundations of Cryptography**[Hol] T. Holenstein

**Lecture Notes in Complexity Theoretic Cryptography**[Kat] J. Katz

**Lecture Notes from Graduate Crypto Course**