一种基于双线性配对的移动通信认证组密钥协商方案  

AN AUTHENTICATED GROUP KEY AGREEMENT SCHEME FOR MOBILE COMMUNICATION BASED ON BILINEAR PAIRING

作　　者：周海[1] 吴丽珍[2] 刘鹏辉[3] 

机构地区：[1]甘肃广播电视大学教务处办公室,甘肃兰州730030 [2]兰州理工大学电子工程与信息工程学院,甘肃兰州730050 [3]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《计算机应用与软件》2012年第4期151-155,共5页Computer Applications and Software

基　　金：甘肃省自然科学基金项目(0809RJZA019)

摘　　要：针对移动通信网络中的安全群组通信需求特点,通过引入基于椭圆曲线密码体制的双线性配对,提出一个高效的认证组密钥协商方案。同时,基于双线性计算性Diffie-Hellman困难问题假设(BCDHP)和双线性离散对数困难问题假设(BDLP)证明了该方案是安全的,能够抵抗恶意节点的身份假冒攻击和同谋破解攻击,具备完美的前向隐私性和后向隐私性,存储、通信和计算开销都比较小,非常适合于终端资源有限的移动通信网络。An efficient authenticated group key agreement scheme is proposed in this paper by importing the elliptic curve cryptosystem-based bilinear pairings and in light of the characteristics of secure group communication requirements in mobile communication networks.This scheme is also provably secure against the impersonation attack as well as the collusive crack attack from malicious nodes under the assumptions of bilinear computational Diffie-Hellman problem and bilinear discrete logarithm problem,and has perfect forward secrecy and backward secrecy of group key.With the virtue of low storage,computation and communication cost,it is very suitable for mobile communication network with limited terminal resources.

关 键 词：组密钥协商 双线性配对 移动通信网络 前向隐私性 后向隐私性 

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