LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1
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 1

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

Zhengzhong Jin teaches this session of MIT's 6.5630 Advanced Topics in Cryptography, continuing the course's treatment of succinct non-interactive arguments for batch NP, known as BARGs, built from the learning with errors (LWE) assumption. The lecture develops the cryptographic machinery needed for this construction, including locally somewhere statistically binding (SSB) commitments with local opening and probabilistically checkable proofs (PCPs) with fast online verification. Jin works through the technical definitions and building blocks at the chalkboard, setting up how these pieces combine to produce succinct arguments for batching many NP statements into one proof. As part one of a two-part treatment, the session focuses on laying the theoretical groundwork rather than completing the full construction. The lecture runs eighty-two minutes and assumes familiarity with prior course material on NP relations, lattice-based cryptography, and proof systems, making it suited to viewers already grounded in theoretical cryptography.

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 13 of 1616 h 22 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