Efficient Asynchronous Accumulators for Distributed PKI

• Published in: Security and Cryptography for Networks pp. 292 - 309
• Main Authors: Reyzin, Leonid, Yakoubov, Sophia
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2016
• Series: Lecture Notes in Computer Science
• Subjects: Cryptographic accumulators
• ISBN: 9783319446172; 3319446177
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-44618-9_16

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.