Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient certificateless threshold signatures without random oracles

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper defines the security notion for Certificateless Threshold Signatures (CLTHS). Different from the adversarial model defined by Wang, et al. (2007), our definition considers Type I and Type II adversary separately. At the same time, the authors develop the simulatability and relationship between certificateless threshold signature and the underlying certificateless signature. We also propose the first CLTHS scheme which is proved existentially unforgeable against adaptively chosen message attack without random oracles. Compared with the previous scheme by Wang, et al. (2007), our scheme does not use hash function and is more efficient.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (France)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Shamir, Identity-Based Cryptosystems and Signature Schemes, ed. by G. R. Blakley, D. Chaum, Advances in Cryptology — CRYPTO84, LNCS 196, Springer-Verlag, 1985: 47–53.

  2. S. S. Al-Riyami and K. G. Paterson, Certificateless Public Key Cryptography, ed. by C. S. Laih, Advances in Cryptology-ASIACRYPT 2003, LNCS 2894, Springer-Verlag, 2003: 452–473.

  3. S. S. Al-Riyami and K. G. Paterson, Certificateless public key cryptography, in Proceedings of the Ninth International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, 2003: 452–473.

  4. J. Baek, R. Safavi-Naini, and W. Susilo, Certificateless Public Key Encryption Without Pairing, ed. by J. Zhou, et al., ISC 2005, LNCS 365, Springer-Verlag, 2005: 134–148.

  5. D. H. Yum and P. J. Lee, Generic Construction of Certificateless Signature, ed. by H. Wang, et al., ACISP 2004, LNCS 3108, Springer-Verlag, 2004: 200–211.

  6. D. H. Yum and P. J. Lee, Generic Construction of Certificateless Encryption, ed. by A. Lagana, et al., ICCSA 2004, LNCS 3043, Springer-Verlag, 2004: 802–811.

  7. C. J. Wang, D. Y. Long, and Y. Tang, An efficient certificateless signature from pairings, International Journal of Network Security, 2009, 8(1): 146–150.

    Google Scholar 

  8. Z. Xu, X. Liu, G. Q. Zhang, et al., A Certificateless Signature Scheme for Mobile Wireless Cyber-Physical Systems, in 28th International Conference on Distributed Computing Systems Workshops 2008 (ICDCS’ 08), 2008: 489–494.

  9. A. Shamir, How to share a secret, Communications of the ACM, 1979, 22(11): 612–613.

    Article  MATH  MathSciNet  Google Scholar 

  10. Blakley GR, Safeguarding cryptographic keys, Proceedings of AFIPS National Computer Conference, Arlington, VA, 1979, 48: 313–317.

    Google Scholar 

  11. M. Cerecedo, M. Matsumoto, and H. Imai, Efficient and secure multiparty generation of digital signatures based on discrete logarithms, IEICE Trans, Fundamentals, 1IEICE, 1993, E76-A: 532–545.

    Google Scholar 

  12. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure distributed key generation for discrete-log based cryptosystem, Proc. of EUROCRYPT’99, LNCS 1592, Springer-Verlag, 1999, 295–310.

  13. C. Boyd, Digital multisignatures, in H. Baker and F. Piper, editors, Cryptography and Coding, Claredon Press, 1989: 241–246.

  14. R. A. Croft and S. P. Harris, Public-Key Cryptography and Re-Usable Shared Secrets, ed. by H. Baker and F. Piper, Cryptography and Coding, Claredon Press, 1989: 189–201.

  15. Y. Desmedt, Society and group oriented cryptography: A new concept, Crypto’87, LNCS, 1987, 293: 120–127.

    Google Scholar 

  16. Alfredo De Santis, Yvo Desmedt, et al., How to share a function securely, Proc. 26th STOC, ACM, 1994: 522–533.

  17. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Crypto’91, LNCS, 1991, 576: 457–469.

    Google Scholar 

  18. Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung, Proactive RSA, Crypto’97, 1294: 440–454.

  19. Y. Frankel, P. Gemmell, and M. Yung, Witness-based cryptographic program checking and robust function sharing, Proc, 28th STOC, 1996: 499–508.

  20. R. Gennaro, H. Krawczyk, and T. Rabin, Robust and efficient sharing of RSA functions, Journal of Cryptology, 2000, 13(2): 273–300.

    Article  MATH  MathSciNet  Google Scholar 

  21. V. Shoup, Practical threshold signatures, Eurocrypt’00, LNCS, 2000, 1807: 207–220.

    Google Scholar 

  22. M. Cerecedo, T. Matsumoto, and H. Imai, Efficient and secure multiparty generation of digital signatures based on discrete logarithms, IEICE Trans. Fundamentals, 1993, E76-A(4): 532–545.

    Google Scholar 

  23. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Information and Computation, Extended abstract in EUROCRYPT’96, 2001, 164(1): 54–84.

    MATH  MathSciNet  Google Scholar 

  24. S. Duan, Z. Cao, and R. Lu, Robust ID-based threshold signcryption scheme from pairings, Proc. 2004 International Conference on Information Security, Shanghai, China, ACM ISBN: 1-58113-955-1, 2004: 33–37.

  25. Vanesa Daza, Javier Herranz, and German Saez, Database and expert systems applications, 2003, proceedings, 14th international workshop on 1–5 Sept. 2003: 359–363.

  26. L. C. Wang, Z. F. Cao, X. X. Li, and H. F. Qian, Simulatability and security of certificateless threshold signatures, Information Sciences, 2007, 177(6): 1382–1394.

    Article  MATH  MathSciNet  Google Scholar 

  27. D. Boneh and M. Franklin, Identity-based encryption from the weil pairing, SIAM Journal of Computing, 2003, 32(3): 586–615.

    Article  MATH  MathSciNet  Google Scholar 

  28. A. Joux and K. Nguyen, Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, Cryptology, ePrint Archive: Report 2001/03.

  29. R. Gennaro, S. Halevi, and T. Rabin, Secure hash-and-sign signatures without the random oracle, Proceedings of Eurocrypt 1999, LNCS, Springer-Verlag, 1999: 123–139.

  30. B. Waters, Efficient identity-based encryption without random oracles, EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, Springer-Verlag, 2005: 114–127.

  31. X. Chen, F. Zhang, D. M. Konidala, and K. Kim, New ID-based threshold signature scheme from bilinear pairing, ed. by A. Canteaut, K. Viswanathan, Advances in Cryptology-INDOCRYPT 2004, LNCS 3348, Springer-Verlag, 2004: 371–383.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200240, China

    Piyi Yang, Zhenfu Cao & Xiaolei Dong

Authors
  1. Piyi Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenfu Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaolei Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenfu Cao.

Additional information

This research is supported by the National Natural Science Foundation of China under Grant Nos. 60773086, 60970110, 60972034, and the National 973 Program under Grant No. 2007CB311201.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, P., Cao, Z. & Dong, X. Efficient certificateless threshold signatures without random oracles. J Syst Sci Complex 23, 1167–1182 (2010). https://doi.org/10.1007/s11424-010-7274-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-010-7274-y

Key words

Search

Navigation