LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Continuation of the GKR Protocol and Corollaries
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Continuation of the GKR Protocol and Corollaries

82 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Advanced Topics in Cryptography · LECTURE 5

Rachel Y. Zhang continues MIT's 6.5630 Advanced Topics in Cryptography with a detailed walkthrough of the GKR protocol, an interactive proof system for verifying circuit computations efficiently. The lecture builds on the prior session's introduction, extending the construction through its corollaries and connecting the material to the IP=PSPACE theorem and its applications. Zhang works through the proof mechanics on the board, covering how a verifier can check a prover's claims about layered arithmetic circuits with minimal computational effort. The session assumes familiarity with interactive proofs and complexity classes, pitched at graduate students already versed in theoretical cryptography. Eighty-two minutes of rigorous, chalkboard-driven argument typical of MIT OpenCourseWare's advanced seminar recordings, with no slides or production flourishes, just sustained technical exposition of a core result in proof systems and verification complexity.

At a glance

Lecture facts

Runtime compared with the other 734 Mathematics lectures
Runtime1 h 22 m
Compared with MathematicsLonger than 86%
This series

Advanced Topics in Cryptography

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 5 of 165 h 13 m before this · 21 h 39 m in total

More from this course

12 LECTURES
Interactive Proofs and the Sum-Check Protocol, Part 1

Interactive Proofs and the Sum-Check Protocol, Part 1

MIT · 91 MIN
Interactive Proofs and the Sum-Check Protocol, Part 2

Interactive Proofs and the Sum-Check Protocol, Part 2

MIT · 66 MIN
Doubly Efficient Interactive Proofs, Part 1

Doubly Efficient Interactive Proofs, Part 1

MIT · 113 MIN
Doubly Efficient Interactive Proofs, Part 2

Doubly Efficient Interactive Proofs, Part 2

MIT · 43 MIN
PCP via GKR and Interactive Arguments, Part 1

PCP via GKR and Interactive Arguments, Part 1

MIT · 90 MIN
PCP via GKR and Interactive Arguments, Part 2

PCP via GKR and Interactive Arguments, Part 2

MIT · 71 MIN
The Kilian-Micali Protocol, Part 1

The Kilian-Micali Protocol, Part 1

MIT · 105 MIN
Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1

Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1

MIT · 93 MIN
Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2

Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2

MIT · 69 MIN
Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1

Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1

MIT · 94 MIN
Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2

Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2

MIT · 65 MIN
Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1

Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1

MIT · 82 MIN