Paper 2025/144
KZH-Fold: Accountable Voting from Sublinear Accumulation
Abstract
Accumulation schemes are powerful primitives that enable distributed and incremental verifiable computation with less overhead than recursive SNARKs. However, existing schemes with constant-size accumulation verifiers, suffer from linear-sized accumulators and deciders, leading to linear-sized proofs that are unsuitable in distributed settings. Motivated by the need for bandwidth efficient accountable voting protocols, (I) We introduce KZH, a novel polynomial commitment scheme, and (II) KZH-fold, the first sublinear accumulation scheme where the verifier only does
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Incrementally verifiable computationZero-knowledge proofAccountable votingSublinear Accumulation
- Contact author(s)
-
asn @ ethereum org
arantxa @ ethereum org
h hafezi @ nyu edu
bb @ nyu edu - History
- 2025-01-31: revised
- 2025-01-30: received
- See all versions
- Short URL
- https://ia.cr/2025/144
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/144, author = {George Kadianakis and Arantxa Zapico and Hossein Hafezi and Benedikt Bünz}, title = {{KZH}-Fold: Accountable Voting from Sublinear Accumulation}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/144}, year = {2025}, url = {https://eprint.iacr.org/2025/144} }