A new dynamic accumulator for batch updates

Authors:
Peishun Wang;Huaxiong Wang;Josef Pieprzyk
Affiliations:
Centre for Advanced Computing - Algorithms and Cryptography, Department of Computing, Macquarie University, Australia;Centre for Advanced Computing - Algorithms and Cryptography, Department of Computing, Macquarie University, Australia and Division of Mathematical Sciences, School of Physical and Mathematical Sci ...;Centre for Advanced Computing - Algorithms and Cryptography, Department of Computing, Macquarie University, Australia
Venue:
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Year:
2007

Citing 10
Cited 6

One-way accumulators: a decentralized alternative to digital signatures

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Paillier's cryptosystem revisited

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Efficient Accumulators without Trapdoor Extended Abstracts

ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Accumulated Hashing

Proceedings of the Third International Workshop on Fast Software Encryption
An Efficient Dynamic and Distributed Cryptographic Accumulator

ISC '02 Proceedings of the 5th International Conference on Information Security
Collision-free accumulators and fail-stop signature schemes without trees

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Accumulators from bilinear pairings and applications

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Compact e-cash from bounded accumulator

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology

Authenticated hash tables

Proceedings of the 15th ACM conference on Computer and communications security
An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data

Information Security Applications
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Super-efficient aggregating history-independent persistent authenticated dictionaries

ESORICS'09 Proceedings of the 14th European conference on Research in computer security
On the impossibility of batch update for cryptographic accumulators

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Optimal authenticated data structures with multilinear forms

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography

Quantified Score

Hi-index	0.00

Visualization

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.