International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK

Authors:
Janno Siim , Simula UiB
Michal Zajac , Nethermind
Helger Lipmaa , Simula UiB
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: ASIACRYPT 2022
Abstract: We propose a univariate sumcheck argument 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, Count is based on inner-product commitments. We use Count to construct a new pairing-based updatable and universal zk-SNARK Vampire with the shortest known argument length (four group and two finite field elements) for NP. In addition, Vampire uses the aggregated polynomial commitment scheme of Boneh et al.
Video from ASIACRYPT 2022
BibTeX
@inproceedings{asiacrypt-2022-32532,
  title={Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK},
  publisher={Springer-Verlag},
  author={Janno Siim and Michal Zajac and Helger Lipmaa},
  year=2022
}