Security Analysis of an Enhanced Certificateless Signcryption in the Standard Model
Quite recently, Luo and Wan putted forward a new certificateless signcryption (CLSC) scheme with low computation cost in the standard model. They stated that their newly proposed scheme achieves the unforgeability against adaptive chosen message attack (i.e, unforgeability) and indistinguishability against adaptive chosen ciphertext attack (i.e., confidentiality). However, we find that the scheme cannot reach the claimed security feature. Specifically, in this paper, we will demonstrate that in Luo and Wan’s CLSC scheme, the plaintext can be easily recovered from the ciphertext by ordinary attacker and malicious-but-passive KGC. In addition, we identify that this scheme even cannot resist forgery attack of a malicious KGC.
KeywordsCertificateless cryptography Signcryption Message unforgeability Message confidentiality Standard model
This work was supported by the Education and Research Foundation of Fujian Province of China for young and middle-aged teacher (Grant No. JAT160350).
- 1.Zheng Y. (1997) Digital signcryption or how to achieve cost(signature & encryption) « cost(signature) + cost(encryption). In B. S. Kaliski (Eds.), Advances in Cryptology—CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, Vol. 1294. Springer: Berlin, Heidelberg.Google Scholar
- 6.Barbosa, M., & Farshim, P. (2008). Certificateless signcryption. In Proceedings of the 2008 ACM symposium on information, computer and communications security (ASIACCS08) (pp. 369–372). New York: ACM.Google Scholar
- 8.Jin, Z., Wen, Q., & Zhang, H. (2010). A supplement to Liu et al.’s certiicateless signcryption scheme in the standard model. Cryptology ePrint Archive, Retrieved from http://eprint.iacr.org/2010/252.pdf. Accessed 3 May 2010.
- 9.Xiong, H. (2014). Toward certiicateless signcryption scheme without random oracles. Cryptology ePrint Archive, Retrieved from http://eprint.iacr.org/2014/162.pdf. Accessed 3 March 2014.