Free online courseAdvanced Topics in Cryptography

Course Description

Strengthen your ability to reason about cutting-edge security systems by mastering the proof techniques that sit behind today’s most powerful cryptographic constructions. This free online course goes beyond introductory primitives and focuses on how modern cryptography is proven secure, how efficiency is achieved, and why certain proof systems have become central to real-world applications in cybersecurity and privacy. If you want to move from knowing definitions to understanding how cryptographers actually build and validate advanced protocols, this course is designed to bridge that gap.

You will explore interactive proofs and the sum-check protocol as a foundational tool for verifying complex statements with limited verifier effort, highlighting why carefully designed randomness is essential for soundness. From there, you will connect these ideas to doubly efficient interactive proofs and the GKR framework, building intuition for how a verifier can be much faster than the prover while still remaining confident in the result. This perspective is especially valuable when thinking about verification in constrained environments such as blockchains, secure computation, and large-scale systems where auditing costs must remain low.

The course then advances to probabilistically checkable proofs and their role in enabling succinct verification, setting the stage for interactive arguments that rely on cryptographic assumptions. You will see how collision-resistant hashing becomes a practical backbone for constructing succinct arguments, and how these components fit together into classical protocols that shaped the field. As the material transitions to the Fiat–Shamir paradigm, the focus turns to making proofs non-interactive while preserving security guarantees, including a careful look at soundness in the standard model—an important lens for evaluating claims you may encounter in papers or implementations.

Finally, you will reach contemporary topics such as succinct non-interactive arguments for batch NP built from LWE and the relationships between BARGs, SNARGs, and non-signaling PCP connections. By engaging with conceptual checkpoints throughout, you will refine your understanding of why these constructions work, what assumptions they depend on, and how to communicate proof ideas clearly. The result is a deeper, more practical cryptography mindset that supports advanced study, security engineering judgment, and research-oriented problem solving.