MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs
Ahmed E. Kosba, Dimitrios Papadopoulos, Charalampos Papamanthou, Dawn Song
摘要
The last few years have witnessed increasing interest in the deployment of zero-knowledge proof systems, in particular ones with succinct proofs and efficient verification (zk-SNARKs). One of the main challenges facing the wide deployment of zk-SNARKs is the requirement of a trusted key generation phase per different computation to achieve practical proving performance. Existing zero-knowledge proof systems that do not require trusted setup or have a single trusted preprocessing phase suffer from increased proof size and/or additional verification overhead. On the other other hand, although universal circuit generators for zk-SNARKs (that can eliminate the need for per-computation preprocessing) have been introduced in the literature, the performance of the prover remains far from practical for real-world applications. In this paper, we first present a new zk-SNARK system that is well-suited for randomized algorithms-in particular it does not encode randomness generation within the arithmetic circuit allowing for more practical prover times. Then, we design a universal circuit that takes as input any arithmetic circuit of a bounded number of operations as well as a possible value assignment, and performs randomized checks to verify consistency. Our universal circuit is linear in the number of operations instead of quasi-linear like other universal circuits. By applying our new zk-SNARK system to our universal circuit, we build MIRAGE, a universal zk-SNARK with very succinct proofs-the proof contains just one additional element compared to the per-circuit preprocessing state-of-the-art zk-SNARK by Groth (Eurocrypt 2016). Finally, we implement MIRAGE and experimentally evaluate its performance for different circuits and in the context of privacy-preserving smart contracts. * A major part of this work was done while Ahmed Kosba was a postdoctoral scholar at UC Berkeley. † Part of this work was done while Charalampos Papamanthou was with Oasis Labs.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper15
- Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine LearningChenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz 等USENIX Security 2021 · 被引用 161 次
- Orion: Zero Knowledge Proof with Linear Prover TimeTiancheng Xie, Yupeng Zhang, Dawn SongCRYPTO 2022 · 被引用 83 次
- Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge ProofsTianyi Liu, Tiancheng Xie, Jiaheng Zhang, Dawn Song 等S&P 2024 · 被引用 52 次
- HyperNova: Recursive Arguments for Customizable Constraint SystemsAbhiram Kothapalli, Srinath T. V. SettyCRYPTO 2024 · 被引用 41 次
- Cirrus: Performant and Accountable Distributed SNARKWenhao Wang, Fangyan Shi, Dani Vilardell, Fan ZhangNDSS 2026 · 被引用 11 次
它引用的顶会 Paper12
- Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart ContractsAhmed E. Kosba, Andrew Miller, Elaine Shi, Zikai Wen 等S&P 2016 · 被引用 2,201 次
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra 等S&P 2018 · 被引用 1,285 次
- Doubly-Efficient zkSNARKs Without Trusted SetupRiad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler 等S&P 2018 · 被引用 356 次
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSAlessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra 等EUROCRYPT 2020 · 被引用 356 次
- Ligero: Lightweight Sublinear Arguments Without a Trusted SetupScott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan VenkitasubramaniamCCS 2017 · 被引用 338 次
相关 Paper
- Transparent Polynomial Delegation and Its Applications to Zero Knowledge ProofJiaheng Zhang, Tiancheng Xie, Yupeng Zhang, Dawn SongS&P 2020 · 被引用 192 次
- Witness-Succinct Universally-Composable SNARKsChaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi 等EUROCRYPT 2023 · 被引用 24 次
- Spartan: Efficient and General-Purpose zkSNARKs Without Trusted SetupSrinath T. V. SettyCRYPTO 2020 · 被引用 262 次
- Eos: Efficient Private Delegation of zkSNARK ProversAlessandro Chiesa, Ryan Lehmkuhl, Pratyush Mishra, Yinuo ZhangUSENIX Security 2023
- ConsCS: Effective and Efficient Verification of Circom CircuitsJinan Jiang, Xinghao Peng, Jinzhao Chu, Xiapu LuoICSE 2025 · 被引用 2 次
