Lecture notes (or sometimes a PowerPoint presentation) with the most essential information will be made available after each lecture.
A preliminary and incomplete list of lectures.
Lectures
- Lecture 1: Introduction - Course organization, bird's-eye view to modern cryptology.
- Lecture 2: Refresher - Basic concepts in cryptology (asymptotics, security modeling, assumptions, reductions, public key encryption)
- Lecture 3: Groups - Discrete-logarithm-based cryptology, including elliptic curves and pairings. We also cover signature schemes and the BLS signature as an example where pairings are useful.
- Lecture 4: Zero-Knowledge Proofs 1 - Zero-knowledge proofs and e-voting as one application. Sigma protocols.
- Lecture 5: Zero-Knowledge Proofs 2 - More Sigma protocols, the Fiat-Shamir heuristic, Schnorr's signature.
- Lecture 6: Post-Quantum Security - Threat of quantum computers to existing cryptology. LWE-based public key encryption as one potential post-quantum secure tool.
- Lecture 7: Commitment Schemes
- Lecture 8: Private Information Retrieval and Oblivious Transfer
- Lecture 9: Verifiable Secret Sharing
- Lecture 10: Multi-Party Computation
- Lecture 11:
- Lecture 12:
- Lecture 13:
- Lecture 14: Blockchain
- Lecture 15: Fully Homomorphic Encryption - Utility of FHE. Additively homomorphic encryption. Brief look into somewhat homomorphic encryption and fully homomorphic encryption.
- Lecture 16: E-voting in Estonia - High-level overview.