Skip to main content

The Analysis of an Efficient and Provably Secure ID-Based Threshold Signcryption Scheme and Its Secure Version

  • Conference paper
  • 709 Accesses

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

Abstract

In this paper,we analyze an identity-based threshold signcryption (IDTSC)scheme proposed in ICCCAS’2008, although Li and Yu pointed out that the scheme is the first provably secure scheme which is secure against adaptive chosen ciphertext attacks and secure in the sense of unforgeability, we show that the signcryption in the scheme is easily forged by the appointed clerk who is one of the members , the clerk can impersonate the members to forge valid signcryption to any receiver, then we give a secure version which we prove its confidentiality under the Decisional Bilinear Diffie-Hellman assumption and its unforgeability under the Computational Diffie-Hellman assumption in the random oracle model. Scheme turns out to be more efficient than the previously proposed schemes.

This work is supported in part by The National Natural Science Foundation of China (60573048, 60773135, 90718007); The High Technology Research and Development Program of China (863 Program) (2007AA01Z427, C2007AA01Z450).

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 341–349. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  2. Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Zheng, Y.: Digital signcryption or how to achieve cost(signature& encryption ) cost(signature) +cost(encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Malone-Lee, J.: Identity-based signcryption. Cryptology ePrint Archive (2002), http://eprint.iacr.org/2002/098/

  5. Libert, B., Quisquater, J.J.: New identity based signcryption schemes from Pairings.Cryptology ePrint Archive (2003), http://eprint.iacr.org/2003/023/

  6. Duan, S., Cao, Z., Lu, R.: Robust ID-based threshold signcryption scheme form Pairings. In: Proceedings of the 3rd international conference on Information security(Infosecu 2004), pp. 33–37. ACM Press, New York (2004)

    Google Scholar 

  7. Peng, C., Li, X.: An identity-based threshold signcryption scheme with semantic security. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol. 3802, pp. 173–179. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Libert, B., Quisquater, J.J.: A new identity based signcryption schemes from pairings. In: Proc. 2003 IEEE information theory workshop, Paris, France, pp. 155–158 (2003)

    Google Scholar 

  9. Ma, C., Chen, K., Zheng, D., Liu, S.: Efficient and proactive threshold signcryption. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 233–243. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Li, F., Yu, Y.: An efficient and provably secure ID-Based threshold signcryption scheme. In: Proc. International Conference on Communications, Circuits and Systems 2008 (IEEE ICCCAS 2008) (2008); Cryptology ePrint Archive, http://eprint.iacr.org/2008/187

  11. An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Baek, J., Zheng, Y.: Identity-based threshold signature scheme from the bilinear pairings. In: IAS 2004 track of ITCC 2004. IEEE Computer Society, pp. 124–128 (2004)

    Google Scholar 

  14. Cheng, X., Liu, J., Wang, X.: An identity-based signature and its threshold version. In: Proc.19th International Conference on Advanced Information Networking and Applications -AINA 2005, pp. 973–977 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, Z., Zhang, Y., Wang, F. (2008). The Analysis of an Efficient and Provably Secure ID-Based Threshold Signcryption Scheme and Its Secure Version. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds) Provable Security. ProvSec 2008. Lecture Notes in Computer Science, vol 5324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88733-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88733-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88732-4

  • Online ISBN: 978-3-540-88733-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics