Abstract
Group signature schemes allow a group member to sign messages anonymously on behalf of the group. In case of dispute, only a designated group manager can reveal the identity of the member. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. However, there has been no scheme properly handling the situation that a group member wants to leave a group or is excluded by a group manager. As noted in [2], the complexity of member deletion stands in the way of real world applications of group signatures and the member deletion problem has been a pressing open problem. In this paper, we propose an efficient group signature scheme that allows member deletion. The length of the group public key and the size of signatures are independent of the size of the group and the security of the scheme relies on the RSA assumption. In addition, the method of tracing all signatures of a specific member is introduced.
This is a preview of subscription content, log in via an institution to check access.
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
G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. In Advances in Cryptology CRYPTO 2000, vol.1880 of LNCS, pp.255–270. Springer Verlag, 2000.
G. Ateniese and G. Tsudik. Group signatures a làcarte. In ACM Symposium on Discrete Algorithms, 1999.
J. Camenisch. Efficient and generalized group signatures. In W. Fumy, editor, Advances in Cryptology-EUROCRYPT’ 97, vol. 1233 of Lecture Notes in Computer Science, pp.465–479. Springer Verlag, 1997.
J. Camenisch and M. Michels. A group signature scheme based on an RSA-variant. Tech. Rep. RS-98-27, BRICS, Dept. of Comp. Sci., University of Arhus, preliminary version in Advances in Cryptology-ASIACRYPT’ 98, vol.1514 of LNCS.
J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology-EUROCRYPT 2019;99, vol.1592 of LNCS, pp.107–122.
J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology-CRYPTO’ 97, vol.1296 of Lecture Notes in Computer Science, pp.410–424. Springer Verlag, 1997.
D. Chaum, and E. van Heyst, Group signatures. In D. W. Davies, editor, Advances in Cryptology-EUROCRYPT’ 91, vol.547 of Lecture Notes in Computer Science, pp.257–265. Springer-Verlag, 1991.
L. Chen and T. P. Pedersen. New group signature schemes. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT’ 94, vol.950 of Lecture Notes in Computer Science, pp.171–181. Springer-Verlag, 1995.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology-CRYPTO’ 97, vol.1294 of Lecture Notes in Computer Science, pp.16–30. Springer Verlag, 1997.
H. Petersen. How to convert any digital signature scheme into a group signature scheme. In M. Lomas and S. Vaudenay, editors, Security Protocols Workshop, Paris, 1997.
A. Shamir. On the generation of cryptographically strong pseudorandom sequences. In ACM Transaction on Computer Systems, vol.1, pp.38–44, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HJ., In Lim, J., Lee, D.H. (2001). Efficient and Secure Member Deletion in Group Signature Schemes. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_12
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive