Group signature schemes allow a group member to sign messages anonymously on behalf of the group. During last decade, group signature schemes have been intensively investigated in the literature and applied to various applications. Especially, as noted in [3], the complexity of member deletion stands in the way of real world applications of group signatures. In this paper, we propose a group signature scheme with an efficient member revocation procedure. The proposed scheme is based on the scheme [18], which was turned out to be flawed [21]. We modify the scheme in [18] so as to obtain secure and efficient member revocation and unlinkability of signatures. Our revocation method is an improvement over the work of Camenisch and Lysyanskaya [9], which is known to be the most efficient scheme so far. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Choi, E. Y., Kim, H. J., & Lee, D. H. (2005). Efficient member revocation in group signature schemes. In Lecture Notes in Computer Science (Vol. 3592, pp. 195–205). Springer Verlag. https://doi.org/10.1007/11537878_20
Mendeley helps you to discover research relevant for your work.