USENIX Security2024Top-tier venue
SoK: What don't we know? Understanding Security Vulnerabilities in SNARKs
Stefanos Chaliasos, Jens Ernstberger, David Theodore, David Wong, Mohammad Jahanara, Benjamin Livshits
Abstract
Zero-knowledge proofs (ZKPs) have evolved from being a theoretical concept providing privacy and verifiability to having practical, real-world implementations, with SNARKs (Succinct Non-Interactive Argument of Knowledge) emerging as one of the most significant innovations. Prior work has mainly focused on designing more efficient SNARK systems and providing security proofs for them. Many think of SNARKs as "just math," implying that what is proven to be correct and secure is correct in practice. In contrast, this paper focuses on assessing end-to-end security properties of real-life SNARK implementations. We start by building foundations with a system model and by establishing threat models and defining adversarial roles for systems that use SNARKs. Our study encompasses an extensive analysis of 141 actual vulnerabilities in SNARK implementations, providing a detailed taxonomy to aid developers and security researchers in understanding the security threats in systems employing SNARKs. Finally, we evaluate existing defense mechanisms and offer recommendations for enhancing the security of SNARK-based systems, paving the way for more robust and reliable implementations in the future.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1d6b498f-fdae-44b7-ae21-aebf27a8ad2fCited by top-tier papers9
- zkFuzz: Foundation and Framework for Effective Fuzzing of Zero-Knowledge CircuitsHideaki Takahashi, Jihwan Kim, Suman Jana, Junfeng YangS&P 2026 · 8 citations
- Split Gröbner Bases for Satisfiability Modulo Finite FieldsAlex Ozdemir, Shankara Pailoor, Alp Bassa, Kostas Ferles et al.CAV 2024 · 4 citations
- Towards a Formal Foundation for Blockchain ZK RollupsStefanos Chaliasos, Denis Firsov, Benjamin LivshitsCCS 2025 · 2 citations
- Evaluating Compiler Optimization Impacts on zkVM PerformanceThomas Gassmann, Stefanos Chaliasos, Thodoris Sotiropoulos, Zhendong SuASPLOS 2026 · 2 citations
- ConsCS: Effective and Efficient Verification of Circom CircuitsJinan Jiang, Xinghao Peng, Jinzhao Chu, Xiapu LuoICSE 2025 · 2 citations
Builds on24
- Bulletproofs: Short Proofs for Confidential Transactions and MoreBenedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra et al.S&P 2018 · 1,285 citations
- ZEXE: Enabling Decentralized Private ComputationSean Bowe, Alessandro Chiesa, Matthew Green, Ian Miers et al.S&P 2020 · 257 citations
- SoK: Understanding the Prevailing Security Vulnerabilities in TrustZone-assisted TEE SystemsDavid Cerdeira, Nuno Santos, Pedro Fonseca, Sandro PintoS&P 2020 · 231 citations
- SoK: Computer-Aided CryptographyManuel Barbosa, Gilles Barthe, Karthik Bhargavan, Bruno Blanchet et al.S&P 2021 · 169 citations
- zkBridge: Trustless Cross-chain Bridges Made PracticalTiancheng Xie, Jiaheng Zhang, Zerui Cheng, Fan Zhang et al.CCS 2022 · 131 citations
Related papers
- SoK: Understanding zk-SNARKs: The Gap Between Research and PracticeJunkai Liang, Daqi Hu, Pengfei Wu, Yunbo Yang et al.USENIX Security 2025
- Formalizing Soundness Proofs of Linear PCP SNARKsBolton Bailey, Andrew MillerUSENIX Security 2024 · 4 citations
- Lattice-Based zk-SNARKs from Square Span ProgramsRosario Gennaro, Michele Minelli, Anca Nitulescu, Michele OrrùCCS 2018 · 62 citations
- Witness-Succinct Universally-Composable SNARKsChaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi et al.EUROCRYPT 2023 · 24 citations
- Spartan and Bulletproofs are Simulation-Extractable (for Free!)Quang Dao, Paul GrubbsEUROCRYPT 2023 · 26 citations
