Skip to main content
Log in

Efficient identity-based GQ multisignatures

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

ISO/IEC 14888 specifies a variety of digital signature mechanisms to sign messages of arbitrary length. These schemes can be applied to provide entity authentication, data origin authentication, non-repudiation, and data integrity verification. ISO/IEC 14888 consists of three parts under the general title Information technology—Security techniques—Digital signatures. Part II, or ISO/IEC 14888-2 specifies the general structure and the fundamental procedures for the generation and verification of an identity-based signature (IBS) mechanism for messages of arbitrary length. Particularly, the IBS scheme of Guillou and Quisquater (GQ) is described in Clauses 6–8. In this paper, an efficient identity-based multisignature (IBMS) scheme is proposed for the GQ IBS scheme, which allows multiple users using the ISO/IEC 14888-2 standard GQ scheme to generate multisignatures. The scheme is efficient in the sense that both the length and the verification time of the multisignatures are fixed. The proposed ID-based multisignature scheme is also secure against forgeability under adaptive chosen-message attack and adaptive chosen-identity attack in random oracle model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Desmedt Y.: Society and group oriented cryptography: a new concept. In: Pomerance, C. (eds) Advances in Cryptology—Crypto’87. Lecture Notes in Computer Science, vol. 293, pp. 120–127. Springer, Berlin (1987)

    Google Scholar 

  2. Chang C., Lee H.: A new generalized group oriented cryposcheme without trusted centers. IEEE J. Selected Areas Commun. 11(5), 725–729 (1993)

    Article  Google Scholar 

  3. Chaum D., Heyst E.v: Group signatures. In: Davies, D.W. (eds) Advances in Cryptology—EuroCrypt’91. Lecture Notes in Computer Science, vol. 547, pp. 257–265. Springer, Berlin (1991)

    Google Scholar 

  4. Desmedt Y., Frankel Y.: Threshold cryptosystems. In: Brassard, G. (eds) Advances in Cryptology—Crypto’89. Lecture Notes in Computer Science, vol 435, pp. 307–315. Springer, Berlin (1989)

    Google Scholar 

  5. Desmedt Y., Frankel Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (eds) Advances in Cryptology—Crypto’91. Lecture Notes in Computer Science, vol. 576, pp. 457–469. Springer, Berlin (1991)

    Google Scholar 

  6. Laih, C., Harn, L.: Generalized threshold cryposystem. In: Advances in Cryptology—ASIACRYPT, pp. 159–169 (1991)

  7. Boyd, C.: Digital multisignatures. Cryptography and Coding, pp. 241–246 (1989)

  8. Harn L.: Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEEE Proc. Comput. Digit. Tech. 141(5), 307–313 (1994)

    Article  MATH  Google Scholar 

  9. Rivest R., Shamir A., Adleman L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. Assoc. Comp. Mach. 21(2), 120–126 (1978)

    MATH  MathSciNet  Google Scholar 

  10. Kohnfelder L.M.: On the signature reblocking problem in public-key cryptography. Commun. ACM 21(2), 179 (1978)

    Google Scholar 

  11. Kiesler T., Harn L.: RSA blocking and multisignature schemes with no bit expansion. Electron. Lett. 26(18), 1490–1491 (1990)

    Article  Google Scholar 

  12. Harn L., Kiesler T.: New scheme for digital multisignature. Electron. Lett. 25(15), 1002–1003 (1989)

    Article  MATH  Google Scholar 

  13. Pon S.-F., Lu E.-H., Lee J.-Y.: Dynamic reblocking rsa-based multisignatures scheme for computer and communication. IEEE Commun. Lett. 6(1), 43–44 (2002)

    Article  Google Scholar 

  14. Shamir A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology: Proceedings of Crypto’84. Lecture Notes in Computer Science, vol. 196, pp. 47–53. Springer, Berlin (1985)

    Google Scholar 

  15. Bellare M., Namprempre C., Neven G.: Security proofs for identity-based identification and signature schemes. In: Koblitz, N. (eds) Advances in Cryptology—EurcoCrypt ’04. Lecture Notes in Computer Science, vol. 3027, pp. 268–286. Springer, Berlin (2004)

    Google Scholar 

  16. Guillou L.C., Quisquater J.J.: A “paradoxical” identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (eds) Advances in Cryptology—Crypto’88. Lecture Notes in Computer Science, vol. 403, pp. 216–231. Springer, Berlin (1989)

    Google Scholar 

  17. I.S.I. 14888-2, Information technology—security techniques—digital signatures wi appendix—part 2: Identity-based mechanisms. December (1999)

  18. Micali, S., Ohta, K., Reyzin, L.: Accountable subgroup multi-signatures. ACM Conference on Computer and communications Security, pp. 245–254. ACM, New York (2004)

  19. Boldyreva A.: Threshold signatures, multi-signatures and blind signatures based on the GDH group signature scheme. In: Goos, G., Hartmanis, J., Leeuwen, J. (eds) Proc. Public Key Cryptography. Lecture Notes in Computer Science, vol. 2567, pp. 31–46. Springer, Berlin (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian Ren.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Harn, L., Ren, J. & Lin, C. Efficient identity-based GQ multisignatures. Int. J. Inf. Secur. 8, 205–210 (2009). https://doi.org/10.1007/s10207-008-0072-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-008-0072-z

Keywords

Navigation