Welcome to the resource topic for 2022/406
Title:
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
Authors: Helger Lipmaa, Janno Siim, and Michal Zajac
Abstract:We propose a univariate sumcheck argument \mathfrak{Count} of essentially optimal communication efficiency of one group element. While the previously most efficient univariate sumcheck argument of Aurora is based on polynomial commitments, \mathfrak{Count} is based on inner-product commitments. We use \mathfrak{Count} to construct a new pairing-based updatable and universal zk-SNARK \mathfrak{Vampire} with the shortest known argument length (four group and two finite field elements) for \mathsf{NP}. In addition, \mathfrak{Vampire} uses the aggregated polynomial commitment scheme of Boneh \emph{et al}.
ePrint: https://eprint.iacr.org/2022/406
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .