Skip to main content
SpringerLink
Log in

Dynamic reversed accumulator

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

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 the credential by providing a corresponding witness. In existing accumulator schemes, all credential holders must update their witnesses when a member joins or is revoked from the system, causing the schemes to become impractical. This paper examines the security of several recent accumulator schemes and proposes a novel approach, the dynamic reversed accumulator, which is more efficient than existing schemes because a corresponding witness can be updated when several members have been revoked.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ateniese, G., Tsudik, G.: Quasi-efficient revocation of group signatures. In: Proceedings of the 7th International Conference on Financial Cryptography—FC ’03, LNCS 2357, pp. 183–197. Springer (2003)

  2. Au, M.H., Tsang, P.P., Susilo, W., Mu, Y.: Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems. In: Proceedings of the Cryptographers’ Track at the RSA Conference 2009—CT-RSA  ’09, LNCS 5473, pp. 295–308. Springer (2009)

  3. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Advances in Cryptology—EUROCRYPT ’04, LNCS 3027, pp. 56–73. Springer (2004)

  4. Backes, M., Camenisch, J., Sommer, D.: Anonymous yet accountable access control. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 40–46 (2005)

  5. Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Advances in Cryptology—EUROCRYPT ’93, LNCS 765, pp. 274–285. Springer (1993)

  6. Brands, S., Paquin, C.: U-Prove Cryptographic Specification v1.1 (2013). http://research.microsoft.com/apps/pubs/default.aspx?id=166969

  7. Barić, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Advances in Cryptology—EUROCRYPT ’97, LNCS 1233, pp. 480–494. Springer (1997)

  8. Camenisch, J.: Efficient and generalized group signatures. In: Advances in Cryptology—EUROCRYPT ’97, LNCS 1233, pp. 465–479. Springer (1997)

  9. Camenisch, J., Groß, T.: Efficient attributes for anonymous credentials. ACM Trans. Inf. Syst. Secur. 15(1), 4 (2012). doi:10.1145/2133375.2133379

    Article  Google Scholar 

  10. Camenisch, J., Herreweghen, E.V.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security—CCS ’02, pp. 21–30 (2002)

  11. Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography—PKC ’09, LNCS 5443, pp. 481–500. Springer (2009)

  12. Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology—CRYPTO ’02, LNCS 2442, pp. 61–76. Springer (2002)

  13. Chen, L., Pedersen, T.P.: New group signature schemes. In: Advances in Cryptology—EUROCRYPT ’94, LNCS 950, pp. 171–181. Springer (1995)

  14. Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Advances in Cryptology—CRYPTO ’97, LNCS 1294, pp. 16–30. Springer (1997)

  15. IDEntity MIXer (IDEMIX). http://www.zurich.ibm.com/security/idemix/

  16. Kim, H.J., Lim, J.I., Lee, D.H.: Efficient and secure member deletion in group signature schemes. In: Proceedings of the 3rd International Conference on Information Security and Cryptology—ICISC ’00, LNCS 2015, pp. 150–161. Springer (2001)

  17. Li, J., Li, N., Xue, R.: Universal accumulators with efficient nonmembership proofs. In: Proceedings of the 5th International Conference on Applied Cryptography and Network Security—ACNS ’07, LNCS 4521, pp. 253–269. Springer (2007)

  18. Mashatan, A., Vaudenay, S.: A fully dynamic universal accumulator. Proc. Roman. Acad. 14, 269–285 (2013)

    MathSciNet  Google Scholar 

  19. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Proceedings of the Cryptographers’ Track at the RSA Conference 2005—CT-RSA  ’05, LNCS 3376, pp. 275–292. Springer (2005)

  20. Song, D.X.: Practical forward secure group signature schemes. In: Proceedings of the 8th ACM Conference on Computer and Communications Security—CCS ’01, pp. 225–234 (2001)

  21. Sander, T., Ta-Shma, A., Yung, M.: Blind, auditable membership proofs. In: Proceedings of the 4th International Conference on Financial Cryptography—FC ’00, LNCS 1962, pp. 53–71. Springer (2001)

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their valuable suggestions that improve the readability of the manuscript. The insightful discussion about the security definition of the proposed scheme provided by Dr. Hsi-Chung Lin is much appreciated. This research was supported in part by the Ministry of Science and Technology of the Republic of China under Contract MOST 103-2221-E-008-083.

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Central University, No. 300, Zhongda Road, Taoyuan, Zhongli, 32001, Taiwan, ROC

    Tsung-Min Kuo, Sung-Ming Yen & Meng-Che Han

Authors
  1. Tsung-Min Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sung-Ming Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meng-Che Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tsung-Min Kuo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kuo, TM., Yen, SM. & Han, MC. Dynamic reversed accumulator. Int. J. Inf. Secur. 17, 183–191 (2018). https://doi.org/10.1007/s10207-017-0360-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-017-0360-6

Keywords

Search

Navigation