- Lecture 1 (Jan. 25):
Intro to cryptography and encryption, public- and private-key.
- Lecture 2 (Feb. 1):
One-way functions, permutations, trapdoor permutations. Applications
- Lecture 3 (Feb. 8):
Brush-up on number theory.
- Lecture 4 (Feb. 15):
Hardcore bits, application to encryption and PRG's.
- Lecture 5 (Feb. 22):
Pseudorandom generators. Definition, constructions, properties.
- Lecture 6: (Feb. 29):
Public-Key encryption. Indistinguishability, semantic security,
provably secure schemes.
- Lecture 7: (Mar. 2):
Efficient Public-key encryption: ElGamal.
CPA security for Symmetric-key encryption.
- Lecture 8: (Mar. 7):
Stream Ciphers. PRFs: Definition, GGM and NR constructions.
- Lecture 9: (Mar. 21):
Applications of PRFs. PRPs and Block Ciphers. Feistel Networks.
Modes of Operation.
- Lecture 10: (Mar. 28):
Encryption in Practice. Intro to Authentication. MACs, UFs and
relation to PRFs. Universal Hash Functions.
- Lecture 11: (Apr. 4):
Constructions of MACs and AU functions.
CCA-secure and authenticated encryption.
- Lecture 12: (Apr. 11):
Collision-Resistant Hash Functions. Intro to Signatures.
- Lecture 13: (Apr. 18):
Digital Signatures. Merkle and Naor-Yung signatures.
Random Oracles and Full Domain Hash.
- Lecture 14: (Apr. 25):
Commitment Schemes: definitions, constructions and applications.
- Lecture 15: (May 2):
Intro to Zero-Knowledge. Honest/Dishonest Verifier. ZK proofs
for NP, Proofs of Knowledge.
- Lecture 1: (Jan. 25)
- Lecture 4: (Feb. 15)
Last modified: May 2, 2012