Paper 2015/718

Efficient Asynchronous Accumulators for Distributed PKI

Leonid Reyzin and Sophia Yakoubov


Cryptographic accumulators are a tool for compact set representation and secure set membership proofs. When an element is added to a set by means of an accumulator, a membership witness is generated. This witness can later be used to prove the membership of the element. Typically, the membership witness has to be synchronized with the accumulator value: it has to be updated every time another element is added to the accumulator, and it cannot be used with outdated accumulator values. However, in many distributed applications (such as blockchain-based public key infrastructures), requiring strict synchronization is prohibitive. We define low update frequency, which means that a witness only needs to be updated a small number of times, and old-accumulator compatibility, which means that a witness can be used with outdated accumulator values. Finally, we propose an accumulator that achieves both of those properties.

Note: minor editorial changes

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Minor revision. SCN 2016
cryptographic accumulatorsPKI
Contact author(s)
sonka @ bu edu
2016-06-26: revised
2015-07-20: received
See all versions
Short URL
Creative Commons Attribution


      author = {Leonid Reyzin and Sophia Yakoubov},
      title = {Efficient Asynchronous Accumulators for Distributed PKI},
      howpublished = {Cryptology ePrint Archive, Paper 2015/718},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.