Interactive Proof Systems Courses and Certifications

Ryan O'Donnell

More on Constant-Round Interactive Proof Systems - Graduate Complexity Lecture at CMU

Explore constant-round interactive proof systems in computational complexity theory, covering MA, AM, BPP, and efficient error reduction techniques.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video

Ryan O'Donnell

IP = PSPACE - Graduate Complexity Lecture at CMU

Explore interactive proof systems and their relationship to complexity classes, focusing on the IP = PSPACE theorem and its implications for computational theory.

• YouTube
• 1 hour 19 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Subgroup Tests and Tailored Non-local Games - Lecture on Interactive Proof Systems

Explore advanced concepts in interactive proof systems, refuting the Aldous-Lyons conjecture through subgroup tests and tailored non-local games.

• YouTube
• 2 hours 2 minutes
• On-Demand
• Free Video

Simons Institute

Self-Proving Models: Learning Algorithms with Interactive Proof Systems

Explore self-proving models and interactive proof systems for ensuring AI output correctness, focusing on algorithms, learning complexity, and practical applications in computational tasks.

• YouTube
• 45 minutes
• On-Demand
• Free Video

Fields Institute

Space-Bounded Quantum Interactive Proof Systems

Explore space-bounded quantum interactive proof systems and their computational complexity implications in this technical presentation.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Ryan O'Donnell

Graduate Complexity Theory

Dive into advanced computational complexity theory with graduate-level lectures covering hierarchy theorems, circuits, interactive proofs, and cutting-edge research topics.

• YouTube
• 1 day 11 hours 50 minutes
• On-Demand
• Free Video

Simons Institute

Efficient Zero-Knowledge Proofs: A Modular Approach

Explore modular techniques for creating efficient zero-knowledge proofs, focusing on probabilistically checkable and interactive proof systems in cryptography.

• YouTube
• 1 hour 12 minutes
• On-Demand
• Free Video

Strange Loop Conference

Rhapsody in Zero Knowledge - Proving Without Revealing

Explore zero-knowledge proofs: a cryptographic technique enabling proof verification without revealing sensitive information, balancing security and privacy in modern computing.

• YouTube
• 38 minutes
• On-Demand
• Conference Talk

Simons Institute

How to Do Fiat-Shamir in the Standard Model

Explore interactive protocols, Fiat-Shamir transformation, and delegation in cryptography. Learn about security assumptions, hash functions, and correlation intractability in probabilistic proof systems.

• YouTube
• 1 hour 10 minutes
• On-Demand
• Free Video

Simons Institute

How to Delegate Computations Publicly

Explore probabilistically checkable and interactive proof systems, focusing on publicly verifiable arguments and non-interactive protocols for delegating computations.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Simons Institute

Transparent SNARKs from DARK Compilers

Explore transparent SNARKs and DARK compilers in cryptography. Learn about polynomial commitments, interactive proof systems, and recent advancements in zero-knowledge proofs for blockchain applications.

• YouTube
• 48 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Discussion on MIP* = RE

Explore the groundbreaking MIP* = RE theorem with MIT's Anand Natarajan, delving into its implications for quantum computing, complexity theory, and the foundations of mathematics.

• YouTube
• 1 hour 33 minutes
• On-Demand
• Free Video

IEEE

NEXP is Contained in MIP* - Complexity Theory Breakthrough

Explore groundbreaking results in computational complexity theory, examining the relationship between NEXP and MIP* with insights from experts Anand Natarajan and John Wright.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Paul G. Allen School

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Explore the relationship between private-coin and public-coin interactive proofs, focusing on efficiency-preserving transformations and their implications for cryptographic assumptions and protocol design.

• YouTube
• 25 minutes
• On-Demand
• Free Video

Simons Institute

Fully Linear PCPs and Their Cryptographic Applications

Explore probabilistically checkable proofs, distributed verifiers, and cryptographic applications with a focus on fully linear PCPs and their impact on secure protocols and communication complexity.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video