Cryptology ePrint Archive: Report 2015/718

Efficient Asynchronous Accumulators for Distributed PKI

Leonid Reyzin and Sophia Yakoubov

Abstract: 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.

Category / Keywords: cryptographic protocols / cryptographic accumulators, PKI

Original Publication (with minor differences): SCN 2016

Date: received 18 Jul 2015, last revised 26 Jun 2016

Contact author: sonka at bu edu

Available format(s): PDF | BibTeX Citation

Note: minor editorial changes

Version: 20160626:232852 (All versions of this report)

Short URL: ia.cr/2015/718

Discussion forum: Show discussion | Start new discussion