A New Dynamic Accumulator for Batch Updates

摘要: A dynamic accumulator is an algorithm, which gathers together a large set of elements into constant-size value such that for given element accumulated, there witness confirming the was indeed included value, with property accumulated can be dynamically added and deleted into/from original cost addition or deletion operation independent number elements. Although first presented ten years ago, still no standard formal definition accumulators. In this paper, we generalize definitions accumulators, formulate security game accumulators so-called Chosen Element Attack (CEA), propose new batch updates based on Paillier cryptosystem. Our construction makes update operations at unit cost. We prove its under extended strong RSA (es-RSA) assumption.