Paper 2021/590 Original: eprint.iacr.org/2021/590 ↗
An Algebraic Framework for Universal and Updatable SNARKs
Abstract
We introduce Checkable Subspace Sampling Arguments, a new information theoretic interactive proof system in which the prover shows that a vector has been sampled in a subspace according to the verifier's coins. We show that this primitive provides a unifying view that explains the technical core of most of the constructions of universal and updatable pairing-based (zk)SNARKs. This characterization is extended to a fully algebraic framework for designing such SNARKs in a modular way. We propose new constructions of CSS arguments that lead to SNARKs with different performance trade-offs. Our most efficient construction, Basilisk, seems to have the smallest proof size in the literature, although it pays a price in terms of structure reference string for the number of multiplicative gates whose fan-out exceeds a certain bound.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2021-08-19: last updated
- 2021-05-10: published
- Short URL
- https://ia.cr/2021/590
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/590,
author = {Carla Ràfols and Arantxa Zapico},
title = {An Algebraic Framework for Universal and Updatable SNARKs},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/590},
year = {2021},
url = {https://eprint.iacr.org/2021/590}
}