Abstract
We consider the problem of revocation of identity in group signatures. Group signatures are a very useful primitive in cryptography, allowing a member of a group to sign messages anonymously on behalf of the group. Such signatures must be anonymous and unlinkable, but a group authority must be able to open them in case of dispute. Many constructions have been proposed, some of them are quite efficient. However, a recurrent problem remains concerning revocation of group members. When misusing anonymity, a cheating member must be revoked by the authority, making him unable to sign in the future, but without sacrifying the security of past group signatures. No satisfactory solution has been given to completely solve this problem. In this paper, we provide the first solution to achieve such action for the Camenish-Stadler [6] scheme. Our solution is efficient provided the number of revoked members remains small.
Chapter PDF
Similar content being viewed by others
References
G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme. In M. Bellare, editor, Crypto’ 2000, volume 1880 of LNCS, pages 255–270. Springer-Verlag, 2000.
G. Ateniese and G. Tsudik. Group Signature à la carte. In 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1999.
G. Ateniese and G. Tsudik. Some Open Issues and New Directions in Group Signature. In Financial Cryptography’ 99, 1999.
M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st Annual Conf. on Computer and Communications Security. ACM Press, 1993.
J. Camenish and M. Michels. A Group Signature with Improved Efficiency. In K. Ohta and D. Pei, editors, Asiacrypt’ 98, volume 1514 of LNCS, pages 160–174. Springer-Verlag, 1999.
J. Camenish and M. Stadler. Efficient Group Signatures Schemes for Large Groups. In B. Kaliski, editor, Crypto’ 97, volume 1294 of LNCS, pages 410–424. Springer-Verlag, 1997.
R. Canetti and S. Goldwasser. An Efficient Threshold PKC Secure Against Adaptive CCA. In J. Stern, editor, Eurocrypt’ 99, volume 1592 of LNCS, pages 90–106. Springer-Verlag, 1999.
D. Chaum and E. van Heyst. Group Signatures. In D.W. Davies, editor, Eurocrypt’ 91, volume 547 of LNCS, pages 257–265. Springer-Verlag, 1992.
L. Chen and T. P. Pedersen. New Group Signature Schemes. In A. De Santis, editor, Eurocrypt’ 94, volume 950 of LNCS, pages 171–181. Springer-Verlag, 1995.
R. Cramer and V. Shoup. A Practical Public-Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In H. Krawczyk, editor, Crypto’ 98, volume 1462 of LNCS, pages 13–25. Springer-Verlag, 1998.
T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In G. R. Blakley and D. Chaum, editors, Crypto’ 84, volume 196 of LNCS, pages 10–18. Springer-Verlag, 1985.
J. Kilian and E. Petrank. Identity Escrow. In H. Krawczyk, editor, Crypto’ 98, volume 1462 of LNCS, pages 169–185. Springer-Verlag, 1998.
S. Kim, S. Park, and D. Won. Convertible Group Signatures. In S. Kim and T. Matsumoto, editors, Asiacrypt’ 96, volume 1163 of LNCS, pages 311–321. Springer-Verlag, 1997.
S. Kim, S. Park, and D. Won. Group Signatures for Hierarchical Multigroups. In Proc. of ISW’ 97, volume 1396 of LNCS, pages 273–281. Springer-Verlag, 1998.
H. Petersen. How to Convert any Digital Signature Scheme into a Group Signature Scheme. In M. Lomas and S. Vaudenay, editors, Proc. of Security Protocols Workshop’ 97, volume 1361 of LNCS, pages 67–78. Springer-Verlag, 1997.
C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In G. Brassard, editor, Crypto’ 89, volume 435 of LNCS, pages 239–252. Springer-Verlag, 1990.
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
Bresson, E., Stern, J. (2001). Efficient Revocation in Group Signatures. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive