Paper 2022/406 Original: eprint.iacr.org/2022/406 ↗
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
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}.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2022-06-23: last updated
- 2022-03-31: published
- Short URL
- https://ia.cr/2022/406
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/406,
author = {Helger Lipmaa and Janno Siim and Michal Zajac},
title = {Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/406},
year = {2022},
url = {https://eprint.iacr.org/2022/406}
}