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
VERIMAG - IMAG - VERIMAG
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.
Type de document :
Communication dans un congrès
The 39th IEEE Conference on Local Computer Networks (LCN), Sep 2014, Edmonton, Canada. 2014
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00999432
Contributeur : Amrit Kumar <>
Soumis le : mardi 3 juin 2014 - 15:33:15
Dernière modification le : mardi 29 mars 2016 - 12:24:33
Document(s) archivé(s) le : mercredi 3 septembre 2014 - 12:15:13

Fichier

KLL_LCN14full.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00999432, version 1

Citation

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

Partager

Métriques

Consultations de
la notice

556

Téléchargements du document

744