Cryptography enables security properties such as privacy, authenticity, and integrity in the digital world. Modern cryptography rigorously defines these notions through precise mathematical formulations of security, together with proofs that reduce to well-studied computational hardness assumptions. This course serves as an introduction to modern cryptography. We will explore core primitives such as pseudorandom generators, symmetric-key encryption, public-key encryption, zero-knowledge proofs, and secure multiparty computation. Along the way, we will develop the mathematical foundations needed to reason about security and understand how these primitives are constructed and analyzed. The course provides a pathway into modern cryptographic research.
When: Tue & Thur 12:45 PM -- 2:05 PM
Where: Smith Hall 201
Lecturer: Mingyuan Wang (Smith Hall 422)
Office Hours: Thur 9:00 AM -- 10:00 AM or by appointment
Symmetric-key Cryptography
Public-key Cryptography
Message Authentication Code and Digital Signature
Zero-knowledge Proofs
Secure Computation
Assignment 1 (Due on Sep 17)
A Graduate Course in Applied Cryptography Dan Boneh and Victor Shoup
The Joy of Cryptography Mike Rosulek
Lecture Notes on Cryptography Shafi Goldwasser and Mihir Bellare
A Course in Cryptography Rafael Pass and Abhi Shelat