签密是一个非常有效的密码学组件,它使传统的数字签名和公钥加密两个功能在一个逻辑算法中完成,从而大大降低了计算复杂度和通信代价。在离散对数问题(DLP)以及计算Diffie-Hellman问题(CDHP)假设下提出了一个新的高效的无证书数字签密方案。在提出方案的签密和解签密算法中,仅仅需要两次双线性对运算,比其他无证书签密方案效率更高。
Signcryption is an efficient eryptographic primitive,it combines digital signature and encryption functions,so it reduces the computation complexity and the communication cost.Iri this paper, a new efficient eertifieateless signeryption scheme is proposed.The proposed scheme is based on the DLP and CDHP.The new scheme only need two pairings in signcryption and de-signeryption stage,it is more efficient than the other certificateless signcryption schemes.