Skip to main content
SpringerLink
Log in

An Efficient and Provably Secure Pairing-Free Certificateless Signature Scheme Based on Variant of RSA

  • Conference paper
  • First Online:
Cyberspace Safety and Security (CSS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10581))

Included in the following conference series:

  • 2148 Accesses

Abstract

Through the application of certificateless signature, certificate management in traditional signatures can be simplified. Furthermore, the key escrow problem in identity-based signatures can be solved as well. As history has shown, there has not been a general pairing-free certificateless signature scheme which is mainly designed with modular exponentiation and modular multiplication that can possess resistance to Type I and Type II adversaries so far. Therefore, a new hard mathematic problem is firstly defined in this paper, which is called variant of RSA problem. In the next step, a new general pairing-free certificateless signature scheme is proposed based on the newly defined variant of RSA problem and the well known discrete logarithm problem. Fortunately, the proposed scheme is also the first RSA-based certificateless signature scheme that can possess resistance to Type I and Type II adversaries. In addition, a formal security proof is provided to demonstrate that, under adaptively chosen message attacks, the proposed scheme is provably secure against Type I and Type II adversaries in the random oracle model. When compared with other known pairing-free certificateless signature schemes of the same type, the computation cost of our scheme is slightly higher, however, a higher security level can be achieved.

This work was partially supported by the National Natural Science Foundation of China (No. 61572311, No. 61472114 and No. 61572318), the Fund of Lab of Security Insurance of Cyberspace, Sichuan Province, the DawnProgram of Shanghai Education Commission (No. 16SG47), the Project of Shanghai Science and Technology Committee (No. 15110500700), the Open Project of Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory 22(6), 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  2. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985). doi:10.1007/3-540-39568-7_5

    Chapter  Google Scholar 

  3. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003). doi:10.1007/978-3-540-40061-5_29

    Chapter  Google Scholar 

  4. Huang, X., Susilo, W., Mu, Y., Zhang, F.: On the security of certificateless signature schemes from asiacrypt 2003. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 13–25. Springer, Heidelberg (2005). doi:10.1007/11599371_2

    Chapter  Google Scholar 

  5. Li, X.-X., Chen, K.-F., Sun, L.: Certificateless signature and proxy signature schemes from bilinear pairings. Lith. Math. J. 45(1), 76–83 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gorantla, M.C., Saxena, A.: An efficient certificateless signature scheme. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS, vol. 3802, pp. 110–116. Springer, Heidelberg (2005). doi:10.1007/11596981_16

    Chapter  Google Scholar 

  7. Yap, W.-S., Heng, S.-H., Goi, B.-M.: An efficient certificateless signature scheme. In: Zhou, X., et al. (eds.) EUC 2006. LNCS, vol. 4097, pp. 322–331. Springer, Heidelberg (2006). doi:10.1007/11807964_33

    Chapter  Google Scholar 

  8. Yum, D.H., Lee, P.J.: Generic construction of certificateless signature. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 200–211. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27800-9_18

    Chapter  Google Scholar 

  9. Cao, X., Paterson, K.G., Kou, W.: An attack on a certificateless signature scheme, IACR Cryptology ePrint Archive 2006, 367 (2006)

    Google Scholar 

  10. Park, J.H.: An attack on the certificateless signature scheme from euc workshops 2006. IACR Cryptology ePrint Archive 2006, 442 (2006)

    Google Scholar 

  11. Zhang, J., Mao, J.: Security analysis of two signature schemes and their improved schemes. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007. LNCS, vol. 4705, pp. 589–602. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74472-6_48

    Chapter  Google Scholar 

  12. Hu, B.C., Wong, D.S., Zhang, Z., Deng, X.: Key replacement attack against a generic construction of certificateless signature. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 235–246. Springer, Heidelberg (2006). doi:10.1007/11780656_20

    Chapter  Google Scholar 

  13. Zhang, Z., Wong, D.S., Xu, J., Feng, D.: Certificateless public-key signature: security model and efficient construction. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 293–308. Springer, Heidelberg (2006). doi:10.1007/11767480_20

    Chapter  Google Scholar 

  14. Huang, X., Mu, Y., Susilo, W., Wong, D.S., Wu, W.: Certificateless signature revisited. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 308–322. Springer, Heidelberg (2007). doi:10.1007/978-3-540-73458-1_23

    Chapter  Google Scholar 

  15. He, D., Chen, J., Zhang, R.: An efficient and provably-secure certificateless signature scheme without bilinear pairings. Int. J. Commun. Syst. 25(11), 1432–1442 (2012)

    Article  Google Scholar 

  16. Tian, M., Huang, L.: Cryptanalysis of a certificateless signature scheme without pairings. Int. J. Commun. Syst. 26(11), 1375–1381 (2013)

    Article  Google Scholar 

  17. Tsai, J.-L., Lo, N.-W., Wu, T.-C.: Weaknesses and improvements of an efficient certificateless signature scheme without using bilinear pairings. Int. J. Commun. Syst. 27(7), 1083–1090 (2014)

    Article  Google Scholar 

  18. Gong, P., Li, P.: Further improvement of a certificateless signature scheme without pairing. Int. J. Commun. Syst. 27(10), 2083–2091 (2014)

    Article  Google Scholar 

  19. Yeh, K.-H., Tsai, K.-Y., Kuo, R.-Z., Wu, T.-C.: Robust certificateless signature scheme without bilinear pairings. In: 2013 International Conference on IT Convergence and Security (ICITCS), pp. 1–4. IEEE (2013)

    Google Scholar 

  20. Yeh, K.-H., Tsai, K.-Y., Fan, C.-Y.: An efficient certificateless signature scheme without bilinear pairings. Multimedia Tools Appl., 1–12 (2014)

    Google Scholar 

  21. Liu, W., Xie, Q., Wang, S., Han, L., Hu, B.: Pairing-free certificateless signature with security proof. J. Comput. Netw. Commun. 2014, 6 (2014)

    Google Scholar 

  22. Harn, L., Ren, J., Lin, C.: Design of dl-based certificateless digital signatures. J. Syst. Softw. 82(5), 789–793 (2009)

    Article  Google Scholar 

  23. Zhang, J., Mao, J.: An efficient rsa-based certificateless signature scheme. J. Syst. Softw. 85(3), 638–642 (2012)

    Article  Google Scholar 

  24. He, D., Khan, M.K., Wu, S.: On the security of a rsa-based certificateless signature scheme. IJ Network Secur. 16(1), 78–80 (2014)

    Google Scholar 

  25. Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996). doi:10.1007/3-540-68339-9_33

    Google Scholar 

Download references

Acknowledgment

The authors are grateful to the reviewers for their comments to improve the quality of this paper.

Author information

Authors and Affiliations

  1. Shanghai University of Electric Power, Shanghai, 200090, China

    Liangliang Wang, Mi Wen & Zhongqin Bi

  2. Xihua University, Chengdu, 610039, China

    Liangliang Wang

  3. Hangzhou Normal University, Hangzhou, 310036, China

    Kefei Chen

  4. Westone Cryptologic Research Center, Beijing, 100070, China

    Kefei Chen

  5. Shanghai Jiao Tong University, Shanghai, 200240, China

    Yu Long

Authors
  1. Liangliang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mi Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kefei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhongqin Bi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yu Long
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mi Wen .

Editor information

Editors and Affiliations

  1. Deakin University , Geelong, China

    Sheng Wen

  2. Fujian Normal University, Fuzhou Shi, China

    Wei Wu

  3. University of Salerno, Fisciano, Italy

    Aniello Castiglione

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wang, L., Wen, M., Chen, K., Bi, Z., Long, Y. (2017). An Efficient and Provably Secure Pairing-Free Certificateless Signature Scheme Based on Variant of RSA. In: Wen, S., Wu, W., Castiglione, A. (eds) Cyberspace Safety and Security. CSS 2017. Lecture Notes in Computer Science(), vol 10581. Springer, Cham. https://doi.org/10.1007/978-3-319-69471-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69471-9_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69470-2

  • Online ISBN: 978-3-319-69471-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation