
Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 2
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.