Skip to main content

Cryptanalysis and Improvement of a Strongly Unforgeable Identity-Based Signature Scheme

  • Conference paper
  • First Online:
Information Security and Cryptology (Inscrypt 2017)

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

Included in the following conference series:

  • 1158 Accesses

Abstract

Recently, Tsai et al. constructed an efficient identity-based signature (IBS) scheme and claimed that it was strongly unforgeable in the standard model. Unfortunately, we find that their scheme is insecure. By giving concrete attack, we show that their scheme does not meet the requirement of strong unforgeability. Meanwhile, we demonstrate that there are serious flaws in their security proof. The simulator cannot correctly answer the signing query in the security model. Furthermore, we propose an improved strongly unforgeable IBS scheme without random oracles. Compared with other strongly unforgeable IBS schemes in the standard model, our scheme is more efficient in terms of computation cost and signature size.

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

Access this chapter

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. 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). https://doi.org/10.1007/3-540-39568-7_5

    Chapter  Google Scholar 

  2. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 586–615 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Paterson, K.G.: ID-based signatures from pairings on elliptic curves. Electron. Lett. 38(18), 1025–1026 (2002)

    Article  Google Scholar 

  4. Yi, X.: An identity-based signature scheme from the weil pairing. IEEE Commun. Lett. 7(2), 76–78 (2003)

    Article  Google Scholar 

  5. Tseng, Y.M., Wu, T.Y., Wu, J.D.: An efficient and provably secure ID-based signature scheme with batch verifications. Int. J. Innovative Comput. Inf. Control 5(11), 3911–3922 (2009)

    Google Scholar 

  6. Shim, K.A.: An ID-based aggregate signature scheme with constant pairing computations. J. Syst. Softw. 83(10), 1873–1880 (2010)

    Article  Google Scholar 

  7. Sun, X., Li, J., Chen, G.: Identity-based verifiably committed signature scheme without random oracles. J. Shanghai Jiaotong Univ. (Science) 13(1), 110–115 (2008)

    Article  Google Scholar 

  8. Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_7

    Chapter  Google Scholar 

  9. Paterson, K.G., Schuldt, J.C.N.: Efficient identity-based signatures secure in the standard model. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 207–222. Springer, Heidelberg (2006). https://doi.org/10.1007/11780656_18

    Chapter  Google Scholar 

  10. Narayan, S., Parampalli, U.: Efficient identity-based signatures in the standard model. IET Inf. Secur. 2(4), 108–118 (2008)

    Article  Google Scholar 

  11. Li, F., Gao, W., Wang, G., et al.: Efficient identity-based threshold signature scheme from bilinear pairings in standard model. Int. J. Internet Protocol Technol. 8(2/3), 107–115 (2014)

    Article  Google Scholar 

  12. Sahu, R.A., Padhye, S.: Provable secure identity-based multi-proxy signature scheme. Int. J. Commun. Syst. 28(3), 497–512 (2015)

    Article  Google Scholar 

  13. Hu, X.M., Wang, J., Xu, H.J., et al.: An improved efficient identity-based proxy signature in the standard model. Int. J. Comput. Math. 94(1), 22–38 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  14. Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 229–240. Springer, Heidelberg (2006). https://doi.org/10.1007/11745853_15

    Chapter  Google Scholar 

  15. Hung, Y.H., Tsai, T.T., Tseng, Y.M., et al.: Strongly secure revocable ID-based Signature without random oracles. Inf. Technol. Control 43(3), 264–276 (2014)

    Google Scholar 

  16. Galindo, D., Herranz, J., Kiltz, E.: On the generic construction of identity-based signatures with additional properties. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 178–193. Springer, Heidelberg (2006). https://doi.org/10.1007/11935230_12

    Chapter  Google Scholar 

  17. Steinfeld, R., Pieprzyk, J., Wang, H.: How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 357–371. Springer, Heidelberg (2006). https://doi.org/10.1007/11967668_23

    Chapter  Google Scholar 

  18. Huang, Q., Wong, D.S., Li, J., et al.: Generic transformation from weakly to strongly unforgeable signatures. J. Comput. Sci. Technol. 23(2), 240–252 (2008)

    Article  MathSciNet  Google Scholar 

  19. Sato, C., Okamoto, T., Okamoto, E.: Strongly unforgeable ID-based signatures without random oracles. Int. J. Appl. Cryptogr. 2(1), 35–45 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kwon, S.: An identity-based strongly unforgeable signature without random oracles from bilinear pairings. Inf. Sci. 276, 1–9 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lee, K., Lee, D.H.: Security analysis of an identity-based strongly unforgeable signature scheme. Inf. Sci. 286, 29–34 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tsai, T.T., Tseng, Y.M., Huang, S.S.: Efficient strongly unforgeable ID-based signature without random oracles. Informatica 25(3), 505–521 (2014)

    Article  Google Scholar 

  23. Zhang, L., Wu, Q., Qin, B.: Identity-based verifiably encrypted signatures without random oracles. In: Pieprzyk, J., Zhang, F. (eds.) ProvSec 2009. LNCS, vol. 5848, pp. 76–89. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04642-1_8

    Chapter  Google Scholar 

  24. Wei, J., Hu, X., Liu, W.: Traceable attribute-based signcryption. Secur. Commun. Netw. 7(12), 2302–2317 (2014)

    Article  Google Scholar 

  25. Cheng, L., Wen, Q., Jin, Z., et al.: Cryptanalysis and improvement of a certificateless aggregate signature scheme. Inf. Sci. 295, 337–346 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (61662069, 61672020, 61472433, 61702309), China Postdoctoral Science Foundation (2017M610817, 2013M542560, 2015T81129), Natural Science Foundation of Gansu Province of China (145RJDA325, 1506RJZA130), Research Fund of Higher Education of Gansu Province (2014-A011), Science and Technology Project of Lanzhou City of China (2013-4-22), Foundation for Excellent Young Teachers by Northwest Normal University (NWNU-LKQN-14-7), Shandong Province Higher Educational Science and Technology Program (No. J16LN61).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaodong Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yang, X., Yang, P., An, F., Li, S., Wang, C., Feng, D. (2018). Cryptanalysis and Improvement of a Strongly Unforgeable Identity-Based Signature Scheme. In: Chen, X., Lin, D., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2017. Lecture Notes in Computer Science(), vol 10726. Springer, Cham. https://doi.org/10.1007/978-3-319-75160-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75160-3_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75159-7

  • Online ISBN: 978-3-319-75160-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics