Probabilistically Checkable Proofs Courses and Certifications

Simons Institute

Crash Course on Probabilistically Checkable Proofs - Introduction

Explore probabilistically checkable proofs, including recoloring, constraint satisfaction, and the PCP theorem. Learn about verifier parameters and hardness of approximation in this comprehensive introduction.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Simons Institute

Probabilistically Checkable Proofs - Part I

Explore probabilistically checkable proofs, focusing on proof verification, randomized verifiers, and proof rewriting techniques in this advanced theoretical computer science lecture.

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

IEEE

Stoquastic PCP vs. Randomness

Explore the intriguing relationship between stoquastic PCP and randomness in quantum computing, delving into cutting-edge research and its implications for complexity theory.

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

Simons Institute

PCPs and Global Hyper-contractivity - Lecture 1

Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.

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

Simons Institute

PCPs and Global Hyper-contractivity - Lecture 1

Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.

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

Simons Institute

PCPs and Global Hyper-contractivity - Lecture 3

Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.

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

Simons Institute

Crash Course on Probabilistically Checkable Proofs - PCP

Explore probabilistically checkable proofs, their formulation, global vs local tests, and computational implications in this comprehensive lecture on advanced theoretical computer science concepts.

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

IEEE

Laconic Conditional Disclosure of Secrets and Applications

Explore innovative cryptographic techniques for secure information sharing, including probabilistically checkable proofs and garbled circuits, with applications in malicious laconic oblivious transfer.

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

IEEE

Local Proofs Approaching the Witness Length

Explore probabilistically checkable proofs, interactive oracle proofs, and tensor codes in this talk on local proofs and witness length optimization.

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

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

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

Simons Institute

Efficient Zero Knowledge Proof from Interactive Proofs

Explore efficient zero-knowledge proofs derived from interactive proofs, focusing on new algorithms, performance improvements, and comparisons to existing systems.

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

Paul G. Allen School

ZK-PCPs from Leakage-Resilient Secret Sharing - 2021 ITC Conference

Explore cutting-edge cryptography research on ZK-PCPs derived from leakage-resilient secret sharing. Learn about innovative constructions combining the best aspects of zero-knowledge proofs and probabilistically checkable proofs.

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