Abstract
The concept of group signatures was introduced by Chaum et al. at Eurocrypt ’91. It allows a member of a group to sign messages anonymously on behalf of the group. In case of a later dispute a designated group manager can revoke the anonymity and identify the originator of a signature. In this paper we propose a new efficient group signature scheme. Furthermore we present a model and the first realization of generalized group signatures. Such a scheme allows to define coalitions of group members that are able to sign on the group’s behalf.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In S. Goldwasser, editor, Advances in Cryptology — CRYPTO’ 88, volume 403 of Lecture Notes in Computer Science, pages 27–35. Springer-Verlag, 1990.
R. Blom. An optimal class of symmetric key generation systems. Proc. EUROCRYPT’84, Lecture Notes in Comp. Sc., vol. 209, New York, NY: Springer Verlag, pages 335–338, 1985.
C. Boyd. Digital multisignatures. In H. J. Beker and F. Piper, editors, Cryptography and Coding, pages 241–246. The Institute of Mathematics and its Applications Conference Series, Oxford Science Publications, 1989.
S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, Apr. 1993.
D. Chaum and T. Pedersen. Wallet databases with observers. In E. F. Brickell, editor, Advances in Cryptology — CRYPTO’ 92, volume 740 of Lecture Notes in Computer Science, pages 89–105. Springer-Verlag, 1993.
D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology — EUROCRYPT’ 91, volume 547 of Lecture Notes in Computer Science, pages 257–265. Springer-Verlag, 1991.
L. Chen and T. P. Pedersen. New group signature schemes. In A. D. Santis, editor, Advances in Cryptology — EUROCRYPT’ 94, volume 950 of Lecture Notes in Computer Science, pages 171–181. Springer-Verlag, 1995.
R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology — CRYPTO’ 94, volume 839 of Lecture Notes in Computer Science, pages 174–187. Springer Verlag, 1994.
R. Croft and S. Harris. Public key cryptography and re-usable shared secrets. In H. J. Beker and F. Piper, editors, Cryptography and Coding, pages 189–201. The Institute of Mathematics and its Applications Conference Series, Oxford Science Publications, 1989.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. Chaum, editors, Advances in Cryptology — CRYPTO’ 84, volume 196 of Lecture Notes in Computer Science, pages 10–18. Springer Verlag, 1985.
P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. 28th IEEE Symp. Found. Comp. Sc., pages 427–437, 1987.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In U. Maurer, editor, Advances in Cryptology — EUROCRYPT’ 96, volume 1070 of Lecture Notes in Computer Science, pages 354–371. Springer Verlag, 1996.
S. J. Kim, S. J. Park, and D. H. Won. Convertible group signatures. In K. Kim and T. Matsumoto, editors, Advances in Cryptology — ASIACRYPT’ 96, volume 1163 of Lecture Notes in Computer Science, pages 311–321. Springer Verlag, 1996.
M. Mambo, K. Usuda, and E. Okamoto. Proxy signatures for delegating signing operation. In 3rd ACM Conference on Computer and Communications Security, pages 48–57, New Delhi, Mar. 1996. acm press.
K. Ohta and T. Okamoto. A digital multisignature scheme based on the Fiat-Shamir scheme. In H. Imai, R. L. Rivest, and T. Matsumoto, editors, Advances in Cryptology — ASIACRYPT’ 91, volume 739 of Lecture Notes in Computer Science, pages 139–148. Springer-Verlag, 1993.
S. J. Park, I. S. Lee, and D. H. Won. A practical group signature. In Proceedings of the 1995 Japan-Korea Workshop on Information Security and Cryptography, pages 127–133, Jan. 1995.
C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239–252, 1991.
A. Shamir. How to share a secret. Commun. ACM, 22(11):612–613, Nov. 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Camenisch, J. (1997). Efficient and Generalized Group Signatures. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive