Provably Secure Certificateless Signcryption Scheme without Pairing
Certificateless signcryption (CLSC) is one of the most significant security primitiocs in CL-PKC, and at the same time achieves confidentia oy and authentication by combining public-key encryption and digital signatures, offering better overall performaicee and security. There are two pairing-free CLSC schemes, which aim at reducing the computing costs by removing pairing. Moreover, these schemes adopt much modular exponential operations, which degrade its computation performance. This paper proposes a new CLSC scheme without pairing, and analyzes its security using random oracles under the computational Diffie-Hellman assumption. It shows that the new scheme is more efficient than all previous constructions.
certificateless cryptography signcryption scheme random oracle computational Dijfie-Heliman assumption
Xiaofei Jing
Information Management Department, Chongqing Changan Automobile Company Chongqing, P.R. China
国际会议
哈尔滨
英文
4753-4756
2011-08-12（万方平台首次上网日期，不代表论文的发表时间）