A Threshold GQ Signature Scheme

  • Li-Shan Liu
  • Cheng-Kang Chu
  • Wen-Guey Tzeng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2846)

Abstract

We proposed the first threshold GQ signature scheme. The scheme is unforgeable and robust against any adaptive adversary if the base GQ signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a safe prime is hard. Furthermore, our scheme can achieve optimal resilience by some modification.

Keywords

threshold signature scheme GQ signature scheme 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CFGN96]
    Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 639–648. ACM, New York (1996)Google Scholar
  2. [CGJ+99]
    Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98–115. Springer, Heidelberg (1999)Google Scholar
  3. [CMI93]
    Cerecedo, M., Matsumoto, T., Imai, H.: Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals E76-A(4), 532–545 (1993)Google Scholar
  4. [Des87]
    Desmedt, Y.: Society and group oriented cryptography: A new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120–127. Springer, Heidelberg (1987)Google Scholar
  5. [DF91]
    Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1991)Google Scholar
  6. [DQ94]
    Delos, O., Quisquater, J.-J.: An identity-based signature scheme with bounded life-span. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 83–94. Springer, Heidelberg (1994)Google Scholar
  7. [FD92]
    Frankel, Y., Desmedt, Y.: Parallel reliable threshold multisignature. Technical Report TR-92-04-02, Dept. of EE and CS, U. of Winsconsin (April 1992)Google Scholar
  8. [FGMY97]
    Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal-resilience proactive public-key cryptosystems. In: Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 384–393. IEEE, Los Alamitos (1997)CrossRefGoogle Scholar
  9. [FGY96]
    Frankel, Y., Gemmell, P., Yung, M.: Witness-based cryptographic program checking and robust function sharing. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC 1996), pp. 499–508. ACM, New York (1996)Google Scholar
  10. [FMY98]
    Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed rsa-key generation. In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 663–672. ACM, New York (1998)CrossRefGoogle Scholar
  11. [FMY99a]
    Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptively-secure distributed public-key systems. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 4–27. Springer, Heidelberg (1999)Google Scholar
  12. [FMY99b]
    Frankel, Y., MacKenzie, P.D., Yung, M.: Adaptively-secure optimal-resilience proactive rsa. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 180–195. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  13. [FS86]
    Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1986)Google Scholar
  14. [GJKR96a]
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of rsa functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157–172. Springer, Heidelberg (1996)Google Scholar
  15. [GJKR96b]
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354–371. Springer, Heidelberg (1996)Google Scholar
  16. [GMW87]
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (STOC 1987), pp. 218–229. ACM, New York (1987)Google Scholar
  17. [GQ88]
    Guillou, L.C., Quisquater, J.-J.: A ”paradoxical” indentity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1988)Google Scholar
  18. [IR01]
    Itkis, G., Reyzin, L.: Forward-secure signatures with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 332–354. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  19. [Jar01]
    Jarecki, S.: Efficient Threshold Cryptosystems. PhD thesis, MIT (2001)Google Scholar
  20. [JL00]
    Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221–242. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  21. [Rab98]
    Rabin, T.: A simplified approach to threshold and proactive rsa. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 89–104. Springer, Heidelberg (1998)Google Scholar
  22. [SDFY94]
    Santis, A.D., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC 1994), pp. 522–533. ACM, New York (1994)Google Scholar
  23. [Sho00]
    Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  24. [WB86]
    Welch, L.R., Berlekamp, E.R.: Error correction of algebraic block codes. U.S. Patent No. 4,633,470 (December 1986)Google Scholar
  25. [Yao82]
    Yao, A.C.-C.: Protocols for secure computations. In: Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 160–164. IEEE, Los Alamitos (1982)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Li-Shan Liu
    • 1
  • Cheng-Kang Chu
    • 1
  • Wen-Guey Tzeng
    • 1
  1. 1.Department of Computer and Information ScienceNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations