Performances of Cryptographic Accumulators

Amrit Kumar 1 Pascal Lafourcade 2 Cédric Lauradoux 3
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 Distributed and Complex Systems
3 PRIVATICS - Privacy Models, Architectures and Tools for the Information Society
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : Cryptographic accumulators are space/time efficient data structures used to verify if a value belongs to a set. They have found many applications in networking and distributed systems since their in- troduction by Benaloh and de Mare in 1993. Despite this popularity, there is currently no performance evaluation of the different existing de- signs. Symmetric and asymmetric accumulators are used likewise without any particular argument to support either of the design. We aim to es- tablish the speed of each design and their application's domains in terms of their size and the size of the values.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download
Contributor : Amrit Kumar <>
Submitted on : Tuesday, June 3, 2014 - 3:33:15 PM
Last modification on : Saturday, October 27, 2018 - 1:20:29 AM
Document(s) archivé(s) le : Wednesday, September 3, 2014 - 12:15:13 PM


Files produced by the author(s)


  • HAL Id : hal-00999432, version 1


Amrit Kumar, Pascal Lafourcade, Cédric Lauradoux. Performances of Cryptographic Accumulators. The 39th IEEE Conference on Local Computer Networks (LCN), Sep 2014, Edmonton, Canada. ⟨hal-00999432⟩



Record views


Files downloads