Mathematics and Computation: The Landscape of P vs. NP

Avi Wigderson · 1:02:49

This lecture establishes the foundational concepts of computational hardness and pseudorandomness, essential for understanding the security assumptions underlying all cryptographic systems.

Proofs, Knowledge, and Computation: Zero-Knowledge Interactive Systems

Silvio Micali · 1:03:26

Building on computational hardness, this lecture introduces interactive proof systems and the revolutionary concept of zero-knowledge, demonstrating how interaction can verify knowledge without revealing it.

IP = PSPACE

Ryan O'Donnell · 1:18:47

Expanding on interactive proofs, this lecture proves the fundamental IP=PSPACE equivalence, showcasing the immense power and scope of interactive verification systems in theoretical computer science.

What Can the Theory of Cryptography Tell Us About AI Verification?

Shafi Goldwasser · 1:02:15

Applying the principles of interactive proofs and cryptographic verification, this lecture explores their practical implications for ensuring the integrity and trustworthiness of AI systems.

Secure Computation and Low-Complexity Cryptography

Yuval Ishai · 1:06:15

This final lecture delves into the efficiency limits of secure computation, integrating concepts of cryptographic primitives and complexity to explore advanced research frontiers in privacy-preserving technologies.