Advertisement

Analysis of an ID-Based Threshold Signcryption Scheme

  • Wei Yuan
  • Liang Hu
  • Xiaochun Cheng
  • Hongtu Li
  • Jianfeng Chu
  • Yuyu Sun
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 113)

Abstract

Signcryption can realize the function of encryption and signature in a reasonable logic step, which can lower computational costs and communication overheads. In 2008, Li et al. proposed an efficient secure id-based threshold signcryption scheme. The authors declared that their scheme had the attributes of confidentiality and unforgeability in the random oracle model. In this paper, we show that scheme is insecure against malicious attackers and give our attacker method to forge the ciphertext.

Keywords

Identity-based Signcryption Bilinear pairing Cryptanalysis 

Notes

Acknowledgments

The authors would like to thank the editors and anonymous reviewers for their valuable comments. This work is supported by the National Natural Science Foundation of China under Grant No. 60873235 and 60473099, the National Grand Fundamental Research 973 Program of China (Grant No. 2009CB320706), Scientific and Technological Developing Scheme of Jilin Province (20080318), and Program of New Century Excellent Talents in University (NCET-06-0300).

References

  1. 1.
    Zheng Y (1997) Digital signcryption or How to achieve cost (signature & Encryption) ≪ cost (signature) + cost (encryption). In: Proceedings of the Advances in CRYPTO’97, LNCS 1294:165–179Google Scholar
  2. 2.
    Bao F, Deng RH (1997) A signcryption scheme with signature directly verifiable by public key. PKC’98. LNCS 1431:55–59Google Scholar
  3. 3.
    Chow SSM, Yiu SM, Hui LCK, Chow KP (2004) Efficient forward and provably secure ID-based signcryption scheme with public verifiability and public ciphertext authenticity. ICISC’03. LNCS 2971:352–269Google Scholar
  4. 4.
    Boyen X (2003) Multipurpose identity based signcryption: a swiss army knife for identity based cryptography. CRYPT’03. LNCS, 2729:383–399Google Scholar
  5. 5.
    Mu Y, Varadharajan V (2000) Distributed signcryption, INDOCRYPT’00. LNCS 1977:155–164Google Scholar
  6. 6.
    Yang G, Wong DS, Deng X (2005) Analysis and improvement of a signcryption scheme with key privacy. ISC’05. LNCS 3650:218–232Google Scholar
  7. 7.
    SteinFeld R, Zheng Y (2000) A signcryption scheme based on integer factorization. ISW’00. LNCS 1975:308–322Google Scholar
  8. 8.
    Libert B, Quisquater J (2004) Efficient signcryption with key prevacy from gap Diffie–Hellman groups. PKC’04 LNCS 2947:187–200Google Scholar
  9. 9.
    Baek J, Steinfeld R, Zheng Y (2002) Formal proofs for the security of signcryption PKC’02. LNCS 2274:80–98Google Scholar
  10. 10.
    Shamir A (1984) Identity-based cryptosystems and signature schemes. CRYPTO’84 LNCS 196:47–53Google Scholar
  11. 11.
    Boneh D, Franklin M (2001) Identity-based encryption from well pairing CRYPTO’01. LNCS 2139:213–229Google Scholar
  12. 12.
    Barreto PSLM, Libert B, Mccullagh N, Quisquater JJ (2005) Efficient and provably-secure identity-based signatures and signcryption from bilinear maps ASIACRYPT’05 LNCS 3788:515–532Google Scholar
  13. 13.
    Li F, Xiong H, Nie X (2009) A new multi-receiver ID-based signcryption scheme for group communications, ICCCAS’2009, pp 296–300 Google Scholar
  14. 14.
    Han Y, Gui X (2009) Multi-recipient signcryption for secure group communication, ICIEA pp 161–165Google Scholar
  15. 15.
    Jin Z, Wen Q, Du H (2010) An improved semantically-secure identity-based signcryption scheme in the standard model. Comput Electr Eng 36(2010):545–552Google Scholar
  16. 16.
    Huang X, Susilo W, Mu Y, Zhang E (2005) Identity-based ring signcryption schemes: cryptographic primitives for preserving privacy and authenticity in the ubiquitous world. 19th International Conference on Advanced Information Networking and Applications, Taiwan, pp 649–654Google Scholar
  17. 17.
    Liu Z, Hu Y, Zhang X, Ma H (2010) Certificateless signcryption scheme in the standard model. Inform Sci 180 (2010):452–464Google Scholar
  18. 18.
    Yu Y, Yang B, Sun Y, Zhu S-l (2009) Identity based signcryption scheme without random oracles. Comput Stand Interf 31(2009):56–62Google Scholar
  19. 19.
    Desmedt Y (1987) Society and group oriented cryptography: a now concept, CRYPTO’87. LNCS 293:120–127Google Scholar
  20. 20.
    Des Frankel Y (1991) Shared generation of authenticators and signatures, CRYPTO’91. LNCS 576:457–469Google Scholar
  21. 21.
    Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126CrossRefMATHMathSciNetGoogle Scholar
  22. 22.
    Baek J, Zheng Y (2004) Identity-based threshold signature scheme from the bilinear pairings. International conference on information technology 2004, Las Vegas, USA, pp 124–128Google Scholar
  23. 23.
    Duan S, Cao Z, Lu R (2004) Robust ID-based threshold signcryption scheme from pairings. International conference on information security. Shanghai, China, pp 33–37Google Scholar
  24. 24.
    Peng C, Li X (2005) An identity-based threshold signcryption scheme with semantic security. Comput Int Secur 2005, LNAI 3902:173–179Google Scholar
  25. 25.
    Libert B, Quisquater JJ (2003) Anew identity based signcryption schemes from pairings, 2003 IEEE information theory workshop. Paris, France, pp 155–158Google Scholar
  26. 26.
    Li F, Yu Y (2008) An efficient and Provably Secure ID-Based Threshold Signcryption Scheme, ICCCAS 2008, pp 488–492Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  • Wei Yuan
    • 1
  • Liang Hu
    • 1
  • Xiaochun Cheng
    • 2
  • Hongtu Li
    • 1
  • Jianfeng Chu
    • 1
  • Yuyu Sun
    • 1
    • 3
  1. 1.Department of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.The School of Computing ScienceMiddlesex UniversityLondonUK
  3. 3.Software InstituteChangchun UniversityChangchunChina

Personalised recommendations