检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:章丽平[1] 崔国华[2] 雷建云[2] 许静芳[2]
机构地区:[1]中国地质大学(武汉)计算机学院,武汉430074 [2]华中科技大学计算机学院,武汉430074
出 处:《计算机应用》2008年第7期1798-1801,共4页journal of Computer Applications
基 金:国家自然科学基金资助项目(60403027);中国地质大学(武汉)优秀青年教师资助计划资助项目(CUGQNL0836)
摘 要:动态协作对等组自身的特征使其安全机制面临着严峻的挑战。密钥协商机制则是构建安全的动态协作对等组的核心技术。提出了一种两方Weil对密钥协商协议(A-WGKA2),可以通过较少的步骤同时实现节点之间的密钥协商和认证。该协议具备如下性质:前向安全性;抵抗未知密钥共享;部分密钥泄露的安全性;抵抗密钥控制;抵抗使用泄露的密钥进行假冒攻击。在A-WGKA2协议的基础上,进一步提出了一个新的适用于动态协作对等组的组密钥协商协议(A-WGKAn)。该协议在具有较低的计算和通信开销的同时,实现了节点之间的相互认证,适用于动态协作对等组。To achieve security in a dynamic collaborative peer group, group key agreement protocol should be provided. Two-party key agreement protocol based on the weil pairing protocol (A-WGKA2) was proposed in this paper. It may establish a secret key between two nodes and authenticate each other by fewer messages. The proposed protocol has the security properties such as forward secrecy, no unknown key-share, known session key security, no key control and no key-compromise impersonation. Further, we proposed a group key agreement protocol using well pairing referred as A-WGKAn that was adapted to the dynamic collaborative peer groups. In the A-WGKAo protocol, the A-WGKA2 protocol was employed on key tree to establish and allocate group key. Therefore, it not only has low computational overhead and communication costs but also provides the node authentication.
关 键 词:动态协作对等组 组密钥协商 WEIL对 网络安全
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229