Cryptology ePrint Archive: Report 2015/087

Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives

David Derler and Christian Hanser and Daniel Slamanig

Abstract: Cryptographic accumulators allow to accumulate a finite set of values into a single succinct accumulator. For every accumulated value, one can efficiently compute a witness, which certifies its membership in the accumulator. However, it is computationally infeasible to find a witness for any non-accumulated value. Since their introduction, various accumulator schemes for numerous practical applications and with different features have been proposed. Unfortunately, to date there is no unifying model capturing all existing features. Such a model can turn out to be valuable as it allows to use accumulators in a black-box fashion.

To this end, we propose a unified formal model for (randomized) cryptographic accumulators which covers static and dynamic accumulators, their universal features and includes the notions of undeniability and indistinguishability. Additionally, we provide an exhaustive classification of all existing schemes. In doing so, it turns out that most accumulators are distinguishable. Fortunately, a simple, light-weight generic transformation allows to make many existing dynamic accumulator schemes indistinguishable. As this transformation, however, comes at the cost of reduced collision freeness, we additionally propose the first indistinguishable scheme that does not suffer from this shortcoming. Finally, we employ our unified model for presenting a black-box construction of commitments from indistinguishable accumulators as well as a black-box construction of indistinguishable, undeniable universal accumulators from zero-knowledge sets. Latter yields the first universal accumulator construction that provides indistinguishability.

Category / Keywords: static, dynamic, universal cryptographic accumulators, unified model, indistinguishability, undeniability, black-box constructions

Original Publication (with major differences): CT-RSA 2015

Date: received 5 Feb 2015, last revised 5 Feb 2015

Contact author: david derler at iaik tugraz at

Available format(s): PDF | BibTeX Citation

Version: 20150214:085122 (All versions of this report)

Short URL: ia.cr/2015/087

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]