LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

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

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

Yael T. Kalai lectures on the Fiat-Shamir paradigm, the technique used to convert interactive proof systems into non-interactive ones by replacing a verifier's random challenges with a hash function. This session, part of MIT's 6.5630 Advanced Topics in Cryptography, examines whether that transformation can be proven sound in the standard model rather than the idealized random oracle model. Kalai introduces correlation-intractable (CI) hash functions, the tool needed to instantiate Fiat-Shamir securely, discusses their existence in the random oracle model, and works through a simple counterexample showing the construction can fail in the plain model. The lecture is blackboard-style and technical, aimed at students already familiar with interactive proofs and hash function assumptions, and sets up the deeper constructions covered in later sessions of the course.

At a glance

Lecture facts

Runtime compared with the other 734 Mathematics lectures
Runtime1 h 34 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 11 of 1613 h 43 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
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 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