A Framework for Post-Quantum Succinct Arguments

on YouTube ↗24m

" summary

Presents a concrete framework that combines hash-only + IOPs to get publicly verifiable, transparent SNARKs and proves they are post-quantum secure in QROM with tight bounds, so parameters can be set for quantum attackers. Uses PCP/IOP backends (STARK-style) so proofs can be tiny (kilobyte-scale conjectured) while provers pay heavy FFT-like costs; authentication-path overhead is the main concrete cost. Includes an implemented transformation and recommends further IOP efficiency work.

AI-written summary · about

" chapters (11)

1. 0:00Intro
2. 0:25The Peer-to-peer Setting
3. 1:36A Shortage of Options
4. 2:38What do we do?
5. 4:19The Framework
6. 6:06Probabilistically Checkable Proois
7. 7:44From PCP to SNARG
8. 12:30The Micali Construction BAD
9. 14:01Interactive Oracle Proofs
10. 14:53BCS Construction from IOP to SNARG
11. 19:53A Framework for

" related talks

• 13mPost-Quantum Succinct Arguments: Breaking the Quantum Rewinding BarrierFermi Ma · Meet the Fellows Welcome Event
• 01h 09mProofs - Practice 1Justin Thaler · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 12mAn Introduction to Commitment-Based Succinct ArgumentsAlessandro Chiesa · Proofs (Simons Institute)
• 58mQuantum 2Mark Zhandry · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 08mTutorial on Proof SystemsAbhishek Jain · Minimal Complexity Assumptions for Cryptography 2023
• 10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure ComputationAbhishek Jain · 9th Annual Simons Institute Industry Day
• 18mSoK: Understanding zk-SNARKs: The Gap Between Research and PracticeJunkai Liang, Daqi Hu, Pengfei Wu, Yunbo Yang, Qingni Shen, Zhonghai Wu · USENIX Security '25
• 01h 15mProofs - TheoryYael Tauman Kalai · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025