论文信息 - A New Signcryption Scheme without Certificate and Linear Pairing

A New Signcryption Scheme without Certificate and Linear Pairing

Most1 certificateless signcryption schemes are based on bilinear pairing operations. Thus, the computation efficiency is low. In this paper, a new signcryption scheme without certificate and linear pairing is proposed. This scheme is proved to be secure in therandom oracle model under the hardness assumption of computational the problem of discrete logarithm. In addition, the user's partial private key can be verified. Compared with other schemes, the scheme is more optimized in terms of security and computation efficiency.

[1] Zhang Shao-wu. Cryptanalysis and improvement of two signcryption schemes , 2011 .

[2] Manuel Barbosa,et al. Certificateless signcryption , 2008, ASIACCS '08.

[3] Jacques Stern,et al. Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.

[4] Liu Wen. Certificateless Signcryption Scheme Without Bilinear Pairing , 2011 .

[5] Yuliang Zheng,et al. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) , 1997, CRYPTO.

[6] Liqun Chen,et al. Identity based authenticated key agreement protocols from pairings , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[7] Kenneth G. Paterson,et al. Certificateless Public Key Cryptography , 2003 .

[8] Shi Lin,et al. A New Certificateless Signcryption Scheme Without Bilinear Pairing , 2018, 2018 13th International Conference on Computer Science & Education (ICCSE).

[9] Fan Ai-jing. Security Analysis and Improvement of a Certificateless Signcryption Scheme , 2012 .

[10] Liqun Chen,et al. Identity-based key agreement protocols from pairings , 2017, International Journal of Information Security.