Skip to main content
Log in

Robust threshold Guillou-Quisquater signature scheme

  • Cryptography
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

The deficiencies of the first threshold Guillou-Quisquater signature scheme presented by Li-San Liu, Cheng-Kang Chu and Wen-Guey Tzeng are analysised at first, and then a new threshold Guillou-Quisquater signature scheme is presented. The new scheme is unforgeable and robust against any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable under the chosen massage attack and computing the discrete logarithm modulo a prime is hard. This scheme can also achieve optimal resilience. However, the new scheme does not need the assumption that N is the product of two safe primes. The basic signature scheme underlying the new scheme is exactly Guillou-Quisquater signature scheme, and the additional strong computation assumption introduced by the first threshold Guillou-Quisquater scheme is weaken.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Desmedt Y G. Threshold Cryptography.European Transaction on Telecommunications, 1994,5(4): 449–457.

    Article  MathSciNet  Google Scholar 

  2. Damgard I, Koprowski M. Practical Threshold RSA Signatures without a trusted Dealer.Proceedings of Advances in Cryptology EUROCRYPT 2001. Berlin: Springer-Verlag Heidelberg, 2001, 152–165.

    Google Scholar 

  3. Shoup V. Practical Threshold Signatures.Proceeding of Advances in Cryptology EUROCRYPT 2000. Berlin: Springer-Verlag, 2000, 207–220.

    Google Scholar 

  4. Gennaro R, Jarecki S, Krawczyk H,et al. Robust threshold DSS signatures.Proceedings of Advances in Cryptology-EUROCRYPT'96. Berlin: Springer-Verlag, 1996. 354–371.

    Google Scholar 

  5. Abdalla M, Miner S, Namprempre C. Forward Security in Threshold Signature Schemes.Proceedings of Topics in Cryptology CT-RSA 2001. Berlin: Springer-Verlag, 2001. 143–158.

    Google Scholar 

  6. Liu L S, Chu C K, Tzeng W G. A Threshold GQ Signature Scheme.Proceedings of Applied Cryptography and Network Security Conference ACNS 2003. Berlin: Springer-Verlag, 2003. 137–150.

    Google Scholar 

  7. Wang H, Feng D G. Robust Threshold FFS Signature Scheme.Proceedings of the 8 th Joint International Computer Conference, JICC 2002. Hangzhou: Zheijiang University Press, 2002. 382–384.

    Google Scholar 

  8. Frankel Y, MacKenzic P D, Yung M. Robust Efficient Distributed RSA-Key Generation.Proceedings of the 30 th ACM Symposium on the Theory of Computation-STOC'98. New York: ACM Press, 1998, 663–672.

    Chapter  Google Scholar 

  9. Guillou L C, Quisquater J. A Paradoxical Indentity-Based Signature Scheme Resulting from Zero-Knowledge.Proceedings of Advances in Cryptology—CRYPTO'88. Berlin: Springer-Verlag, 1988, 216–231.

    Google Scholar 

  10. Abo M. Robust Distributed Multiplication without Interaction.Proceedings of Advances in Cryptology-CRYPTO'99 Berlin: Springer-Verlag, 1999, 130–147.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Foundation item: Supported by the National Key Basic Research Program of China (G1999035802) and the National Natural Science Foundation of China (60373039)

Biography: WANG Hong (1972-), male, Post doctor, research direction: modern eryptography and information, security.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hong, W., Zhen-feng, Z. & Deng-guo, F. Robust threshold Guillou-Quisquater signature scheme. Wuhan Univ. J. Nat. Sci. 10, 207–210 (2005). https://doi.org/10.1007/BF02828651

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02828651

Key words

CLC number

Navigation