Article

A New Dynamic Accumulator for Batch Updates

Authors:

Josef PieprzykAuthors Info & Claims

Information and Communications Security: 9th International Conference, ICICS 2007, Zhengzhou, China, December 12-15, 2007. Proceedings

Pages 98 - 112

https://doi.org/10.1007/978-3-540-77048-0_8

Published: 12 December 2007 Publication History

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.

References

[1]

Au M.H., Wu Q., Susilo W., and Mu Y. Abe M. Compact E-Cash from Bounded Accumulator Topics in Cryptology – CT-RSA 2007 2006 Heidelberg Springer 178-195

[2]

Baric N. and Pfitzmann B. Fumy W. Collision-free accumulators and fail-stop signature schemes without trees Advances in Cryptology - EUROCRYPT ’97 1997 Heidelberg Springer 480-494

[3]

Benaloh J. and Mare M. Helleseth T. One-way accumulators: a decentralized alternative to digital signatures Advances in Cryptology - EUROCRYPT ’93 1994 Heidelberg Springer 274-285

[4]

Camenisch J. and Lysyanskaya A. Yung M. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials Advances in Cryptology - CRYPTO 2002 2002 Heidelberg Springer 61-76

[5]

Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.: Paillier’s Cryptosystem Revisited. In: ACM CCS 2001, pp. 206–214 (2001)

[6]

Dodis Y., Kiayias A., Nicolosi A., and Shoup V. Cachin C. and Camenisch J.L. Anonymous Identification in Ad Hoc Groups Advances in Cryptology - EUROCRYPT 2004 2004 Heidelberg Springer 609-626

[7]

Fazio, N., Nicolosi, A.: Cryptographic Accumulators: Definitions, Constructions and Applications. Available (2003), at http://www.cs.nyu.edu/fazio/papers/

[8]

Gentry C. and Ramzan Z. Zhang K. and Zheng Y. RSA Accumulator Based Broadcast Encryption Information Security 2004 Heidelberg Springer 73-86

[9]

Goodrich M., Tamassia R., and Hasić J. Chan A.H. and Gligor V.D. An efficient dynamic and distributed cryptographic accumulator Information Security 2002 Heidelberg Springer 372-388

[10]

Nguyen L. Menezes A.J. Accumulators from Bilinear Pairings and Applications Topics in Cryptology – CT-RSA 2005 2005 Heidelberg Springer 275-292

[11]

Nyberg K. Gollmann D. Fast accumulated hashing 3rd Fast Software Encryption Workshop 1996 Heidelberg Springer 83-87

[12]

Paillier P. Stern J. Public-Key Cryptosystems based on Composite Degree Residue Classes Advances in Cryptology - EUROCRYPT ’99 1999 Heidelberg Springer 223-238

[13]

Pohlig S. and Hellman M. An Improved Algorithm for Computing Logarithms in GF(p) and its Cryptographic Significance IEEE Trans. Inform. Theory 1978 IT-24 106-111

[14]

Sander T. Varadharajan V. and Mu Y. Efficient accumulators without trapdoor Information and Communication Security 1999 Heidelberg Springer 252-262

[15]

Tsudik G. and Xu S. Laih C.-S. Accumulating Composites and Improved Group Signing Advances in Cryptology - ASIACRYPT 2003 2003 Heidelberg Springer 269-286

[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/103

Cited By

Barthoulot ABlazy OCanard S(2024)Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable ProofsProgress in Cryptology - AFRICACRYPT 202410.1007/978-3-031-64381-1_5(94-119)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-64381-1_5
Ren YLiu XWu QWang LZhang W(2022)Cryptographic Accumulator and Its ApplicationSecurity and Communication Networks10.1155/2022/54291952022Online publication date: 7-Mar-2022
https://dl.acm.org/doi/10.1155/2022/5429195
Alupotha JBoyen XMcKague M(2022)Zero-History Confidential Chains with Zero-Knowledge Contracts: A New Normal for Decentralized Ledgers?Computer Security – ESORICS 202210.1007/978-3-031-17140-6_4(67-88)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17140-6_4

Index Terms

A New Dynamic Accumulator for Batch Updates

Index terms have been assigned to the content through auto-classification.

Recommendations

A new dynamic accumulator for batch updates
ICICS'07: Proceedings of the 9th international conference on Information and communications security

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 ...
Dynamic reversed accumulator

Anonymous credential schemes have been widely employed to prove the authenticity of a member by revealing specific member attributes while concealing the real identity from the verifier. Furthermore, an accumulator is used to demonstrate the validity of ...
Improvement of a Dynamic Accumulator at ICICS 07 and Its Application in Multi-user Keyword-Based Retrieval on Encrypted Data
APSCC '08: Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference

A dynamic accumulator is an algorithm, which merges a large set of elements into a constant-size value such that for an element accumulated, there is a witness confirming that the element was included into the value, with a property that accumulated ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Information and Communications Security: 9th International Conference, ICICS 2007, Zhengzhou, China, December 12-15, 2007. Proceedings

Dec 2007

520 pages

ISBN:978-3-540-77047-3

DOI:10.1007/978-3-540-77048-0

Editors:
Sihan Qing
Institute of Softwear, Chinese Academy of Sciences, 100080, Beijing, China
,
Hideki Imai
Research Center for Information Security (RCIS),, National Institute of Advanced Industrial Science and Technology, AIST, Japan
,
Guilin Wang
School of Computer Science, University of Birmingham, B15 2TT, Birmingham, UK

© Springer-Verlag Berlin Heidelberg 2007.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 December 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Barthoulot ABlazy OCanard S(2024)Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable ProofsProgress in Cryptology - AFRICACRYPT 202410.1007/978-3-031-64381-1_5(94-119)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-64381-1_5
Ren YLiu XWu QWang LZhang W(2022)Cryptographic Accumulator and Its ApplicationSecurity and Communication Networks10.1155/2022/54291952022Online publication date: 7-Mar-2022
https://dl.acm.org/doi/10.1155/2022/5429195
Alupotha JBoyen XMcKague M(2022)Zero-History Confidential Chains with Zero-Knowledge Contracts: A New Normal for Decentralized Ledgers?Computer Security – ESORICS 202210.1007/978-3-031-17140-6_4(67-88)Online publication date: 26-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17140-6_4
Papamanthou CTamassia RTriandopoulos NNing PSyverson PJha S(2008)Authenticated hash tablesProceedings of the 15th ACM conference on Computer and communications security10.1145/1455770.1455826(437-448)Online publication date: 27-Oct-2008
https://dl.acm.org/doi/10.1145/1455770.1455826

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents