Simons Institute Courses

Succinct Non-interactive Arguments of Proximity

Explore advanced cryptographic proof systems enabling verification of extremely long statements through short messages and sublinear reading, featuring novel commitment schemes.

• YouTube
• 1 hour 2 minutes
• Self-Paced
• Free Video

Error-Correcting Codes That Enable Efficient SNARKs

Explore error-correcting codes that power efficient SNARKs, examining code families, core properties, and prover-verifier tradeoffs in cryptographic proof systems.

• YouTube
• 1 hour
• Self-Paced
• Free Video

Towards SNARGs for NP from Standard Assumptions

Explore recent advances in constructing SNARGs for NP from standard cryptographic assumptions, bypassing indistinguishability obfuscation requirements.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

An Introduction to Lattice-Based Folding Schemes

Discover lattice-based folding schemes for scalable proof systems with post-quantum security benefits and faster proving techniques.

• YouTube
• 1 hour 6 minutes
• Self-Paced
• Free Video

Accountable AI with ZKPs - Certifying Fairness and Explanations under Model Confidentiality

Discover how zero-knowledge proofs enable AI accountability by certifying fairness and explanations while maintaining model confidentiality in high-stakes applications.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

An Introduction to Commitment-Based Succinct Arguments

Discover how succinct arguments combine probabilistic proofs with cryptographic commitments through an elegant unified framework that illuminates the SNARG landscape.

• YouTube
• 1 hour 12 minutes
• Self-Paced
• Free Video

A Zero-Knowledge PCP Theorem

Discover how to achieve zero-knowledge proofs that are locally checkable, combining two fundamental complexity theory results into a unified framework for secure verification.

• YouTube
• 1 hour 13 minutes
• Self-Paced
• Free Video

Batch Arguments and Their Applications

Discover how batch arguments (BARGs) enable construction of succinct non-interactive arguments from standard cryptographic assumptions and their applications in replacing SNARKs.

• YouTube
• 1 hour 10 minutes
• Self-Paced
• Free Video

Tree PCPs - Probabilistically Checkable Proofs for Ongoing Computation

Discover tree PCPs, a novel proof system where proofs evolve incrementally over time, enabling efficient verification of ongoing computations with minimal query complexity.

• YouTube
• 1 hour 2 minutes
• Self-Paced
• Free Video

SP1 Hypercube and the Jagged Polynomial Commitment Scheme

Discover how SP1 Hypercube uses multilinear proof-systems and jagged polynomial commitment schemes to verify high-level program correctness in real-world applications.

• YouTube
• 1 hour 7 minutes
• Self-Paced
• Free Video

Towards a White-Box Secure Fiat-Shamir Transformation

Explore a novel cryptographic transformation defending against white-box attacks on Fiat-Shamir protocols, combining standard techniques with proof-of-work for enhanced security.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors

Discover a simplified LWE-based construction for non-interactive zero-knowledge proofs using lattice trapdoors without correlation intractability or FHE techniques.

• YouTube
• 33 minutes
• Self-Paced
• Free Video

Incrementally Verifiable Computation for NP from Standard Assumptions

Discover how to construct incrementally verifiable computation for NP problems using standard cryptographic assumptions, overcoming previous barriers in proof systems.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

Incremental Verifiable Computation and Proof-Carrying Data

Explore incremental verifiable computation and proof-carrying data, covering definitions, low-memory distributed provers, SNARK constructions, and open research problems.

• YouTube
• 1 hour 2 minutes
• Self-Paced
• Free Video

Functional Commitments

Discover functional commitment schemes, a key primitive for building efficient succinct argument systems that enable committing to messages and proving function evaluations.

• YouTube
• 1 hour
• Self-Paced
• Free Video