Can I read Ligero: Lightweight Sublinear Arguments Without a Trusted Setup on EtoBox?

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup by Scott Ames, Carmit Hazay, Yuval Ishai, and Muthuramakrishnan Venkitasubramaniam is a scholarly article available to read on EtoBox.

What is Ligero: Lightweight Sublinear Arguments Without a Trusted Setup about?

We design and implement a simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the veri cation circuit size. The protocol can be based on any collision-resistant hash function. Alternatively, it can be made non-interactive in the random oracle model, yielding concretely e cient zk-SNARKs that do not require a trusted setup or public-key cryptography. Our protocol is attractive not only for very large veri cation circuits but also for moderately large circuits that arise in applications. For instance, for verifying a SHA-256 preimage in zeroknowledge with 2 -40 soundness error, the communication complexity is roughly 44KB (or less than 34KB under a plausible conjecture), the prover running time is 140 ms, and the veri er running time is 62 ms. This proof is roughly 4 times shorter than a similar proof of ZKB++ (Chase et al., CCS 2017), an optimized variant of ZKBoo (Giacomelli et al., USENIX 2016). The communication complexity of our protocol is independent of the circuit structure and depends only on the number of gates. For 2 -40 soundness error, the communication becomes smaller than the circuit size for circuits cont

Author

Scott Ames, Carmit Hazay, Yuval Ishai, and Muthuramakrishnan Venkitasubramaniam

Publisher

ACM

Published

2017

Language

EN