Proofs, Knowledge, and Computation

on YouTube ↗01h 03m

" summary

Describes an interactive protocol that proves graph non‑isomorphism by the verifier choosing a random permutation of either G or H and the prover identifying which was permuted, showing IP captures statements beyond NP (IP = PSPACE mentioned); defines zero‑knowledge as convincing without leaking anything (example: prove knowledge of factors of n without revealing primes, usable as passwords); surveys interactive proofs (IP), zero-knowledge proofs, and SNARKs that produce phone‑verifiable, succinct proofs.

AI-written summary · about

" chapters (13)

1. 0:00Start
2. 2:52Thank You Berkeley!
3. 3:34Thank You Computer Science!
4. 6:35Proof 1
5. 6:51What Are Proofs?
6. 24:34Cloud Computing
7. 27:28The Knowledge Act
8. 51:00Collaboration
9. 51:48Fortune
10. 52:57Stubbornness
11. 55:15Limitations
12. 56:28Inspiration
13. 57:46Find Yourselves!

" related talks

• 41mGKR based Zero-Knowledge ProofsYael Tauman Kalai · 2nd ZKProof Workshop 2019
• 26mApplications of Zero Knowledge Proofs in the Banking IndustryEduardo Moraes · 2nd ZKProof Workshop 2019
• 44mBilinear Pairings-based Zero-Knowledge ProofsJens Groth · 2nd ZKProof Workshop 2019
• 51mWhy you shouldn't trust meKeerthana Ganesh, Shubham Patil · NDC Oslo 2022
• 44mIOP based Zero-Knowledge ProofsAlessandro Chiesa · 2nd ZKProof Workshop 2019
• 44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacyTjerand Silde · NDC Security 2026
• 54mVerification Dilemmas, Law, and the Promise of Zero-Knowledge ProofsShafi Goldwasser · 4th ZKProof Workshop (Home Edition)
• 35mEfficient Zero Knowledge Protocols: The Modular ApproachYuval Ishai · 2nd ZKProof Workshop 2019