|
MoneroResearch.info |
 |
 |
 |
|
Gailly, N., Maller, M., & Nitulescu, A. 2022, May 2–6, SnarkPack: Practical SNARK Aggregation. Unpublished paper presented at Financial Cryptography and Data Security 2022. Added by: Rucknium (05/05/2022, 21:04) |
 |
| Resource type: Conference Paper BibTeX citation key: Gailly2022 View all bibliographic details  |
Categories: Monero-focused Creators: Gailly, Maller, Nitulescu Collection: Financial Cryptography and Data Security 2022 |
Views: 28/3135
|
Attachments
24.pdf  [8/976]
|
URLs https://fc22.ifca. ... proceedings/24.pdf |
| Abstract |
|
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short and efficiently verifiable proofs that do not re- veal anything more than the correctness of the statement. zk-SNARKs are widely used in decentralised systems to address privacy and scalabil- ity concerns. A major drawback of such proof systems in practice is the requirement to run a trusted setup for the public parameters. Moreover, these param- eters set an upper bound to the size of the computations or statements to be proven, which results in new scalability problems. We design and implement SnarkPack, a new argument that further re- duces the size of SNARK proofs by means of aggregation. Our goal is to provide an off-the-shelf solution that is practical in the following sense: (1) it is compatible with existing deployed SNARK systems, (2) it does not require any extra trusted setup. SnarkPack is designed to work with Groth16 scheme and has logarithmic size proofs and a verifier that runs in logarithmic time in the number of proofs to be aggregated. Most importantly, SnarkPack reuses the public parameters from Groth16 system. SnarkPack can aggregate 8192 proofs in 8.7s and verify them in 163ms, yielding a verification mechanism that is exponentially faster than other solutions. SnarkPack can be used in blockchain applications that rely on many SNARK proofs such as Proof-of-Space or roll-up solutions. |