Abstract
The concept of group signature allows a group member to sign message anonymously on behalf of the group. In the event of a dispute, a designated entity can reveal the identity of a signer. Previous group signature schemes use an RSA signature based membership certificate and a signature based on a proof of knowledge(SPK) in order to prove the possession of a valid membership certificate. In these schemes, SPK is generated over an unknown-order group, which requires more works and memory compared with a publicly-known-order group. Recently, a group signature based on a known-order group is proposed. However, it requires an unknown-order group as well as a known-order group. Furthermore, unfortunately, it does not provide the function of revocation. In this paper, we propose the group signature scheme based on only publicly-known-order groups. Our scheme improves the Nyberg-Rueppel signature to fit for generating membership certificates and uses SPKs over a cyclic group whose order is publicly known. As a result, our scheme reduces the size of group signature and the computational amount of signature generation and verification.
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
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., de Medeiros, B.: Efficient group signatures without trapdoors, Cryptology ePrint Archive, available from http://citeseer.nj.nec.com/ateniese02efficient.html
Ateniese, G., Tsudik, G.: Quasi-efficient revocation of group signatures. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, Springer, Heidelberg (2003)
E. Bresson and J. Stern, ”Group signatures with efficient revocation”, In proceeding of PKC 2001, LNCS 1992(2001), pp. 190-206.
Camenisch, J.: Efficient and generalized group signature. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 465–479. Springer, Heidelberg (1997)
Camenisch, J.: Group signature schemes and payment systems based on the discrete logarithm problem, PhD thesis, vol. 2 of ETH-Series in Information Security an Cryptography, Hartung-Gorre Verlag, Konstanz (1998) ISBN 3-89649-286-1
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–76. Springer, Heidelberg (2002)
Camenisch, J., Michels, M.: A group signature scheme based on an RSAvariant, preliminary version in Advances in Cryptology - ASIACRYPT 1998, Tech. Rep., RS-98-27, BRICS (1998)
Camenisch, J., Stadler, M.: Efficient group signature schemes for large group. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997)
Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)
Chaum, D., Evertse, J.H., van de Graaf, J.: An improved protocol for demonstration possession of discrete logarithms and some generalizations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 127–141. Springer, Heidelberg (1988)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transaction on Information Theory IT-22, 654–664 (1976)
Knuth, D.E.: The Art of Computer Programming. Addison-Wesley Publishing Co., Reading (1981)
Nyberg, K., Rueppel, R.A.: Message recovery for signature scheme based on the discrete logarithm problem. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 182–193. Springer, Heidelberg (1995)
Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology 4(3), 239–252 (1991)
Song, D.: Practical Forward-Secure group signature schemes. In: Proceeding of 2001 ACM Symposium on Computer and Communication Security (2001)
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
Miyaji, A., Umeda, K. (2004). A Fully-Functional Group Signature Scheme over Only Known-Order Group. In: Jakobsson, M., Yung, M., Zhou, J. (eds) Applied Cryptography and Network Security. ACNS 2004. Lecture Notes in Computer Science, vol 3089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24852-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24852-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22217-0
Online ISBN: 978-3-540-24852-1
eBook Packages: Springer Book Archive