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

Silvio Micali · 1:03:26

Building on computational hardness, this lecture introduces zero-knowledge interactive proofs, demonstrating how interaction and randomness enable verifiable computation without revealing sensitive information.

IP = PSPACE

Ryan O'Donnell · 1:18:47

Expanding on interactive proofs, this lecture delves into the theoretical power of IP systems, showing their equivalence to PSPACE and highlighting their broad computational capabilities.

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

Shafi Goldwasser · 1:02:15

Applying the principles of interactive proofs and cryptographic techniques, this lecture explores their practical utility in verifying complex systems like AI, showcasing real-world applications of theoretical concepts.

SHA-3 Hash Function

Christof Paar · 1:38:17

Transitioning from theoretical proofs to practical primitives, this lecture examines the SHA-3 hash function, a core component in many cryptographic protocols, illustrating concrete construction methods.

Introduction to Hash-based Post-quantum Cryptography (PQC)

Christof Paar · 1:40:59

Finally, this lecture addresses the future of cryptography by introducing hash-based post-quantum cryptography, building on hash function knowledge to tackle emerging threats from quantum computing.