An algebraic framework for universal and updatable SNARKs
Carla Ràfols, Zapico Barrionuevo, Victoria Arantxa · Repositori digital de la UPF (Universitat Pompeu Fabra) · 2021
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.