无双线性对的无证书两方密钥协商方案

Certificateless two-party key agreement scheme without bilinear pairing

近几年来,有许多无证书密钥协商方案相继被提出,它们都需要双线性对运算,而且它们中大部分不能抵抗密钥泄露伪装攻击和临时私钥泄露产生的攻击。2009年,Lippold等人提出一个可证安全无证书密钥协商协议,但该协议需要较大计算量。为了解决上述问题,给出了一个新的无双线性对运算无证书两方密钥协商方案,并分析了它的安全属性,只要每方至少有一个未泄露的秘密,那么新方案就是安全的。因此,即使密钥生成中心知道双方的临时私钥,新方案也是安全的。与Lippold等人的协议相比,新方案降低了计算复杂度。

A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what＇s more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme （CL-KA） and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold＇s protocol.