Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser
Ruihan Wang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
Abstract
Zero-Knowledge (ZK) proofs were introduced in the seminal work of Goldwasser, Micali, and Rackoff (STOC 1985) and remain one of the cornerstones of modern cryptography. With the advent of Blockchains, there has been reinvigorated interest in deploying ZK-proof systems in the form of ZK-SNARKs. ZKSNARKs are an attractive variant as they are non-interactive (in fact, publicly verifiable) and succinct. Yet, current deployments require huge running times and/or very large memory, and scaling them to large circuits cannot be accomplished on commodity hardware. We design and implement an efficient sublinear non-interactive zero-knowledge system, Ligetron that can be deployed as a web application and scales to billions of gates. Core to our construction is identifying a good intermediate representation, namely Web Assembly (WASM) that is: (1) versatile to represent complex computations, (2) can be compiled from most popular high-level languages, and (3) embodies rich semantics to derive space-efficiency. On the backend, we design and implement a space-efficient variant of the Ligero ZK system introduced in the work of Ames et al. (ACM CCS 2017) that can leverage the semantics of WASM. Ligetron is the first post-quantum ZK-SNARK to scale to billion gates and run from a browser. On commodity hardware, Ligetron scales to arbitrarily large circuits while showcasing competitive prover/verifier running times and better proof lengths than all previous post-quantum ZK-SNARKs.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 2dceccce-2685-410f-b1b3-9d9a857a122bCited by top-tier papers4
- zkLogin: Privacy-Preserving Blockchain Authentication with Existing CredentialsFoteini Baldimtsi, Konstantinos Kryptos Chalkias, Yan Ji, Jonas Lindstrøm et al.CCS 2024 · 21 citations
- Hobbit: Space-Efficient zkSNARK with Optimal Prover TimeChristodoulos Pappas, Dimitrios PapadopoulosUSENIX Security 2025
- Scribe: Low-memory SNARKs via Read-Write StreamingAnubhav Baweja, Pratyush Mishra, Tushar Mopuri, Karan Newatia et al.USENIX Security 2026
- Exploring and Exploiting the Resource Isolation Attack Surface of WebAssembly ContainersZhaofeng Yu, Dongyang Zhan, Lin Ye, Haining Yu et al.USENIX Security 2025
Related papers
- Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum SignaturesJonathan Katz, Vladimir Kolesnikov, Xiao WangCCS 2018 · 257 citations
- Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from LatticesYuval Ishai, Hang Su, David J. WuCCS 2021 · 3 citations
- Ligero++: A New Optimized Sublinear IOPRishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam et al.CCS 2020 · 69 citations
- Hekaton: Horizontally-Scalable zkSNARKs Via Proof AggregationMichael Rosenberg, Tushar Mopuri, Hossein Hafezi, Ian Miers et al.CCS 2024 · 7 citations
- LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge ProofsMatteo Campanelli, Dario Fiore, Anaïs QuerolCCS 2019 · 3 citations
