Cryptology ePrint Archive: Report 2019/1047

Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

Alessandro Chiesa and Yuncong Hu and Mary Maller and Pratyush Mishra and Noah Vesely and Nicholas Ward

Abstract: We present a methodology to construct preprocessing zkSNARKs where the structured reference string (SRS) is universal and updatable. This exploits a novel use of *holography* [Babai et al., STOC 1991], where fast verification is achieved provided the statement being checked is given in encoded form.

We use our methodology to obtain a preprocessing zkSNARK where the SRS has linear size and arguments have constant size. Our construction improves on Sonic [Maller et al., CCS 2019], the prior state of the art in this setting, in all efficiency parameters: proving is an order of magnitude faster and verification is thrice as fast, even with smaller SRS size and argument size. Our construction is most efficient when instantiated in the algebraic group model (also used by Sonic), but we also demonstrate how to realize it under concrete knowledge assumptions. We implement and evaluate our construction.

The core of our preprocessing zkSNARK is an efficient *algebraic holographic proof* (AHP) for rank-1 constraint satisfiability (R1CS) that achieves linear proof length and constant query complexity.

Category / Keywords: foundations / succinct arguments; universal SRS; algebraic holographic proofs; polynomial commitments

Date: received 13 Sep 2019, last revised 19 Sep 2019

Contact author: alexch at berkeley edu,pratyush@berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20190919:220438 (All versions of this report)

Short URL: ia.cr/2019/1047


[ Cryptology ePrint archive ]