Home > Resources > courses > Stanford-CS355-Topics-Cryptography
Stanford CS 355: Topics in Cryptography¶
Last modified: 2026-10-23
Summary¶
Stanford graduate course on advanced cryptography whose content varies by offering; the current schedule covers commitments, elliptic curves and pairings, interactive proofs and zero knowledge, Sigma protocols, Fiat-Shamir, polynomial commitments and polynomial IOPs, MPC and lattice-based cryptography. Earlier offerings were referenced in the e-ID project notes as an applied introduction to ZKPs. Lecture notes and problem sets are public.