Title: Cryptographic accumulators
Abstract: Cryptographic accumulator is a primitive,
introduced in 1993 by Benaloh and De Mare, that
allows the representation of a set by a short value
and offers(non-)membership proofs. Through the
years, accumulators have been used for multiple
purposes, resulting in new properties specific
to individual needs.
Unfortunately, all these new properties and
functionalities were added separately, giving rise
to several definitions of accumulators, with often
their own notations. That is why in 2015, Derler,
Hanser and Slamanig proposed a unified formal
model, dealing with most of existing accumulators’
properties.
Their work became a reference and a building block
when working with accumulators. However, since
2015 new properties of accumulators have been
introduced and some functionalities of accumulators
were not taken into account in the work of Derler et al.
Their model became then obsolete and no one has
come up with a new model that complements the old one.
In this presentation, I will present you our new unified
overview of the cryptographic accumulator primitive
and a new accumulator satisfying most of the existing
properties (based on the one by Gosh et al.). To conclude,
I will shortly give you an intuition of a future use of
cryptographic accumulators as building block for
attribute based encryption scheme.
