摘要
提出一种不含对运算的无证书隐式认证及密钥协商协议。该协议基于离散对数问题和可计算Diffie-Hellman假设,仅需要3次指数运算和2次散列运算,可避免复杂的双线性对运算。在随机预言机模型下的分析结果表明,该协议具有强安全性,计算开销低于同类型的其他协议。
Due to the large amount of computing cost in bilinear pairing,this paper proposes a certificateless implicit authentication and key agreement protocol without pairing operation,and proves its security in the random oracle model.The new protocol is based on the discrete logarithm problem and the Computational Diffie-Hellman（CDH） assumption,requires only three times exponentiations and two times hash functions.The computing costs of this protocol lower than costs of the other ones that are the same type with the one in this paper.
出处
《计算机工程》
CAS
CSCD
2012年第2期138-140,共3页
Computer Engineering
关键词
无证书
双线性对
离散对数问题
隐式认证
密钥协商
certificateless
bilinear pairing
discrete logarithm problem
implicit authentication
key agreement
