Title :
Performances of cryptographic accumulators
Author :
Kumar, Ajit ; Lafourcade, Pascal ; Lauradoux, Cedric
Author_Institution :
Privatics team, INRIA Rhone-Alpes, Grenoble, France
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 introduction by Benaloh and de Mare in 1993. Despite this popularity, there is currently no thorough performance evaluation of the different existing designs. Symmetric and asymmetric accumulators are used likewise without any particular argument to support either of the design. We aim to establish the speed of each design and their application´s domains in terms of their size and the size of the values.
Keywords :
cryptography; data structures; distributed processing; performance evaluation; asymmetric accumulators; cryptographic accumulator performance evaluation; distributed systems; networking systems; space efficient data structures; time efficient data structures; Cryptography; Data structures; Electronic mail; Elliptic curves; Indexes; Vectors; Bloom filter; Cryptographic accumulators; Performance;
Conference_Titel :
Local Computer Networks (LCN), 2014 IEEE 39th Conference on
Conference_Location :
Edmonton, AB
Print_ISBN :
978-1-4799-3778-3
DOI :
10.1109/LCN.2014.6925793
