Abstract
The problem of secure and efficient revocation of membership without incurring big costs has been considered, but no satisfactory solution was reported. In this paper, we propose a new revocation method of membership based on the ACJT group scheme. Our solution is efficient in that it only needs one multiplication and one exponentiation, which the length of exponent is fixed, to update the public key for the group manager to exclude a group member, and the signing and verifying procedure are independent of the number of current group members and excluded group members. To the best of our knowledge, the signing and verifying procedures in prior revocation schemes are dependent of the number either current group members or excluded group members, and thus the group manager needs a heavy computation load to update the public key.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255–270. Springer, Heidelberg (2000)
Ateniese, G., Tsudik, G.: Quasi-efficient revocation of group signature (2001), http://eprint.iacr.org/2001/101/
Bresson, E., Stern, J.: Group signatures with efficient revocation. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 190–206. Springer, Heidelberg (2001)
Camenisch, J., Lysyanskaya, A.: Efficient non-transferable anonymous multishow credential system with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 93–118. Springer, Heidelberg (2001)
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–77. Springer, Heidelberg (2002)
Camenish, J., Stadler, M.: Efficient group signatures for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997)
Kim, H., Lim, J., Lee, D.: Efficient and secure member deletion in group signature schemes. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 150–161. Springer, Heidelberg (2001)
Lysyanskaya, A., Ramzan, Z.: Group blind digital signatures: A scalable solution to electronic cash. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 184–197. Springer, Heidelberg (1998)
Schnorr, C.P.: Efficient identification and signature for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)
Sakurai, K., Miyazaki, S.: An anonymous electronic bidding protocol based on a new convertible group signature scheme. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 385–399. Springer, Heidelberg (2000)
Song, D.: Practical forward secure group signature schemes. In: Proceedings of 2001 ACM Symposium on Computer and Communication Security (November 2001)
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) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Z., Wang, J., Wang, Y., Huang, J., Huang, D. (2004). An Efficient Revocation Algorithm in Group Signatures. In: Lim, JI., Lee, DH. (eds) Information Security and Cryptology - ICISC 2003. ICISC 2003. Lecture Notes in Computer Science, vol 2971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24691-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24691-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21376-5
Online ISBN: 978-3-540-24691-6
eBook Packages: Springer Book Archive