CryptographyInstructor : Andrej Bogdanov
Textbook : Introduction to Modern Cryptography , Jonathan Katz ,Yehuda Lindell
Download slides from here
| 1 | What is cryptography? The one-time pad. Computational assumptions. | [pdf] |
| 2 | Message indistinguishability and semantic security. Pseudorandom generators. Private-key encryption. | [pdf] |
| 3 | Pseudorandom functions. Chosen plaintext attacks. | [pdf] |
| 4 | Construction of pseudorandom functions. Message authentication. Chosen ciphertext attacks. | [pdf] |
| 5 | Construction of CCA-secure encryptions. Variable-length MACs. | [pdf] |
| 6 | Cryptographic hash functions. One-way functions and pseudorandom generators. | [pdf] |
| 7 | The Goldreich-Levin theorem. | [pdf] |
| 8 | Public-key encryption. | [pdf] |
| 9 | Oblivious transfer and secure two-party computation. | [pdf] |
| 10 | Two-party protocol for honest-but-curious adversaries. Bit commitment and coin flipping. | [pdf] |
| 11 | Zero-knowledge proofs. | [pdf] |
| 12 | Enforcing honesty in two-party computation. | [pdf] |
No comments:
Post a Comment