Accumulation without Homomorphism

ePrint Report: Accumulation without Homomorphism

Benedikt Bünz, Pratyush Mishra, Wilson Nguyen, William Wang

Accumulation schemes are a simple yet powerful primitive that enable highly efficient constructions of incrementally verifiable computation (IVC). Unfortunately, all prior accumulation schemes rely on homomorphic vector commitments whose security is based on public-key assumptions.
It is an interesting open question to construct efficient accumulation schemes that avoid the need for such assumptions.


In this paper, we answer this question affirmatively by constructing an accumulation scheme from …

computation enable eprint report key nguyen public question report security simple wang