@inproceedings{1925cf166e91491a85254ea085012e10,
title = "A new dynamic accumulator for batch updates",
abstract = "A dynamic accumulator is an algorithm, which gathers together a large set of elements into a constant-size value such that for a given element accumulated, there is a witness confirming that the element was indeed included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set such that the cost of an addition or deletion operation is independent of the number of accumulated elements. Although the first accumulator was presented ten years ago, there is still no standard formal definition of accumulators. In this paper, we generalize formal definitions for accumulators, formulate a security game for dynamic accumulators so-called Chosen Element Attack (CEA), and propose a new dynamic accumulator for batch updates based on the Paillier cryptosystem. Our construction makes a batch of update operations at unit cost. We prove its security under the extended strong RSA (es-RSA) assumption.",
author = "Peishun Wang and Huaxiong Wang and Josef Pieprzyk",
year = "2007",
language = "English",
isbn = "9783540770473",
volume = "4861 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "98--112",
editor = "Sihan Qing and Hideki Imai and Guilin Wang",
booktitle = "Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings",
address = "United States",
note = "9th International Conference on Information and Communications Security, ICICS 2007 ; Conference date: 12-12-2007 Through 15-12-2007",
}