A new dynamic accumulator for batch updates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4861 LNCS, Issue , 2007, Pages 98-112

  Wang, Peishun ^a   Wang, Huaxiong ^a,b   Pieprzyk, Josef ^a  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Dynamic accumulator; Paillier cryptosystem

Indexed keywords

COST EFFECTIVENESS; CRYPTOGRAPHY; FORMAL LANGUAGES; LARGE SCALE SYSTEMS; SET THEORY;

CHOSEN ELEMENT ATTACK (CEA); DYNAMIC ACCUMULATORS; PAILLIER CRYPTOSYSTEM;

DYNAMIC PROGRAMMING;

EID: 38149049937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77048-0_8     Document Type: Conference Paper

References (16)

1. Au, M.H., Wu, Q., Susilo, W., Mu, Y.: Compact E-Cash from Bounded Accumulator. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 178-195. Springer, Heidelberg (2006)
2. Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480-494. Springer, Heidelberg (1997)
3. Benaloh, J., Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274-285. Springer, Heidelberg (1994)
4. Camenisch, J., Lysyanskaya, A.: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61-76. Springer, Heidelberg (2002)
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., Shoup, V.: Anonymous Identification in Ad Hoc Groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609-626. Springer, Heidelberg (2004)
7. Fazio, N., Nicolosi, A.: Cryptographic Accumulators: Definitions, Constructions and Applications. Available (2003), at http://www.cs.nyu.edu/ fazio/papers/
8. Gentry, C., Ramzan, Z.: RSA Accumulator Based Broadcast Encryption. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 73-86. Springer, Heidelberg (2004)
9. Goodrich, M., Tamassia, R., Hasić, J.: An efficient dynamic and distributed cryptographic accumulator. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 372-388. Springer, Heidelberg (2002)
10. Nguyen, L.: Accumulators from Bilinear Pairings and Applications. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275-292. Springer, Heidelberg (2005)
11. Nyberg, K.: Fast accumulated hashing. In: Gollmann, D. (ed.) 3rd Fast Software Encryption Workshop. LNCS, vol. 1039, pp. 83-87. Springer, Heidelberg (1996)
12. Paillier, P.: Public-Key Cryptosystems based on Composite Degree Residue Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
13. Pohlig, S., Hellman, M.: An Improved Algorithm for Computing Logarithms in GF(p) and its Cryptographic Significance. IEEE Trans. Inform. Theory IT-24, 106-111 (1978)
14. Sander, T.: Efficient accumulators without trapdoor. In: Varadharajan, V., Mu, Y. (eds.) Information and Communication Security. LNCS, vol. 1726, pp. 252-262. Springer, Heidelberg (1999)
15. Tsudik, G., Xu, S.: Accumulating Composites and Improved Group Signing. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 269-286. Springer, Heidelberg (2003)
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