LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 2
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

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

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

Zhengzhong Jin continues MIT's 6.5630 Advanced Topics in Cryptography with the second half of a lecture on building succinct non-interactive arguments for batch NP statements (BARGs) from the learning with errors assumption. He develops the local somewhere statistically binding (SSB) commitment scheme with local opening, then shows how to pair it with a probabilistically checkable proof (PCP) featuring fast online verification to assemble the full BARG construction. The lecture is blackboard-style and assumes familiarity with prior sessions on LWE and batch argument systems, walking through the cryptographic components step by step rather than summarizing results. It is part of a graduate seminar at MIT OpenCourseWare covering advanced constructions in theoretical cryptography.

At a glance

Lecture facts

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

Advanced Topics in Cryptography

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 14 of 1617 h 44 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 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