International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: An Algebraic Framework for Universal and Updatable SNARKs

Authors:
Arantxa Zapico , Pompeu Fabra University
Carla Ràfols , Pompeu Fabra University and Cybercat
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2021
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.
Video from CRYPTO 2021
BibTeX
@inproceedings{crypto-2021-31216,
  title={An Algebraic Framework for Universal and Updatable SNARKs},
  publisher={Springer-Verlag},
  author={Arantxa Zapico and Carla Ràfols},
  year=2021
}