检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北师范大学数学与信息科学学院,兰州730070
出 处:《计算机应用》2012年第8期2258-2261,2327,共5页journal of Computer Applications
基 金:国家自然科学基金资助项目(61063041;61163038)
摘 要:针对Ad Hoc网络能源受限、动态变化的特性,提出一个基于身份的组密钥协商机制。该机制基于簇结构,允许同步执行基于对的多方密钥协商协议,从而使得簇成员数不影响密钥协商;密钥协商期间不需要交互,进而提供安全认证和动态性。在判定性双线性Diffie-Hellman(DBDH)问题下证明了该机制的语义安全性,并与已有方案在安全性、通信量和计算量方面进行了比较,结果表明所提机制在协商轮数和认证性方面具有优势。In view of the characteristics of limited energy and dynamic change in Ad Hoc network, an identity-based group key agreement scheme was presented. The topology was in a structure composed by clusters, and allowed the synchronous execution of multi-party key agreement protocols based on pairings. The number of cluster members did not affect the key agreement, and it did not require interactivity during the key agreement. It provided the authentication and dynamics. In addition, the scheme was proved semantics secure under the Decisional Bilinear Diffie-Hellman (DBDH) problem. At lastl compared with the previous schemes, the proposed scheme has advantages in terms of negotiation rounds and authentication.
分 类 号:TP393.084[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31