A New Dynamic Accumulator for Batch Updates
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.
KeywordsDynamic accumulator Paillier cryptosystem
Unable to display preview. Download preview PDF.
- 5.Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.: Paillier’s Cryptosystem Revisited. In: ACM CCS 2001, pp. 206–214 (2001)Google Scholar
- 7.Fazio, N., Nicolosi, A.: Cryptographic Accumulators: Definitions, Constructions and Applications. Available (2003), at http://www.cs.nyu.edu/fazio/papers/
- 16.Zhang, F., Che, X.: Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 2005, Cryptology ePrint Archive, Report 2005/103Google Scholar