强安全的和无双线性对的基于身份密钥协商  

Identity-based authenticated key agreement protocol featuring strong security and no bilinear paring operation

作　　者：李芳[1,2] 陈明[3] 

机构地区：[1]重庆城市管理职业学院,重庆401331 [2]重庆大学计算机学院,重庆400044 [3]宜春学院数学与计算机学院,江西宜春336000

出　　处：《计算机工程与科学》2013年第6期65-71,共7页Computer Engineering & Science

基　　金：重庆市国土资源和房屋管理局项目(KJ2011010)

摘　　要：为了降低计算开销,提出了基于身份的认证密钥协商协议ID-AKA。新协议基于椭圆曲线离散对数难题,采用隐式认证方式,仅需一轮信息交互,并且去除了计算量大的双线性对运算。参考Chen等人的ID-AKA安全模型和LaMacchia等人的安全模型,通过增加会话临时秘密查询,提出了分析ID-AKA协议的强安全模型。同时,指出了舒剑等人的安全模型约束条件过强,不能有效分析协议的密钥泄露伪装安全性。在新模型下,新协议是可证明安全的。对比分析表明,新协议不仅实现了强安全性,而且计算开销更低,适用于在移动通信环境下建立安全的端到端连接。To reduce the computation cost, a novel Identity-based Authenticated Key Agreement Protocol （ID-AKA） was proposed. Based on the elliptic curve discrete logarithm problem, the new pro- tocol minimizes message exchange times with only one exchange by using an implicit authentication, and removes computation-intensive bilinear paring operation. Based on the ID-AKA security model proposed by Chen et al. and the eCK model proposed by LaMacchia et al. , by adding Ephemeral-Secure query, a stronger model for ID-AKA protocols was proposed. Meanwhile, the paper pointed out that the security model proposed by Shu Jian was ineffective to analyze the key-compromise impersonation in ID-AKA protocols, because the model constraints are too strong. Under the new model, the new protocol is provably secure. Comparative analysis shows that the new protocol with not only strong security but al- so lower computational overhead is suitable for establishing a secure end-to-end connection in mobile communication environment.

关 键 词：身份密码体制 椭圆曲线 离散对数问题 认证密钥协商 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]