LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

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

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

Yael T. Kalai continues MIT's 6.5630 Advanced Topics in Cryptography with a lecture on removing interaction from zero-knowledge proofs. She proves that the Merkle hash construction is collision resistant, then shows how the Fiat-Shamir paradigm converts interactive protocols into non-interactive ones by replacing a verifier's random challenges with a hash function. The lecture's core work is proving the soundness of the Kilian-Micali protocol in the random oracle model, walking through the argument step by step on the board. This is a technical, proof-heavy session aimed at students who already know the basics of interactive proofs and hash-based commitments, building toward succinct non-interactive arguments. Ninety-three minutes of blackboard cryptography from MIT OpenCourseWare, part of a graduate-level sequence on advanced topics in the field.

At a glance

Lecture facts

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

Advanced Topics in Cryptography

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 9 of 1611 h 1 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
Continuation of the GKR Protocol and Corollaries

Continuation of the GKR Protocol and Corollaries

MIT · 82 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
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