摘要: 树状结构的组密钥管理协议可以解决Ad Hoc网络中成员之间的共享密钥问题,从而保证合法组成员之间得到一个安全共享的组密钥。对3种基础树状结构的组密钥管理协议的原理和结构特征进行分析,对成员加入、离开、合并和分割时各自产生的通信量和计算量进行对比,得出不同树状结构的组密钥管理协议在Ad Hoc网络中的适应性,为更复杂的树状结构在Ad Hoc网络的应用提供重要参考及技术保障。
关键词:
树状结构,
组密钥管理,
Ad Hoc网络,
通信量,
计算量
Abstract: Tree-based group key agreement protocol that allows group members to compute the group key based on their individual contributions can provide verifiable trust relationship between participants in Ad Hoc networks. The principles and structural features of three tree-based group key agreement protocols are discussed, and the communication and computation that generated by each protocol are compared when their members are adding in, leaving, merging or breaking up. The analysis and comparison results show that each tree-based group key agreement protocol is applicable to corresponding Ad Hoc networks. It also provides reference and technical support for application of more complicated tree structure in Ad Hoc networks.
Key words:
tree structure,
group key management,
Ad Hoc networks,
communication traffic,
amount of computation
中图分类号:
涂山山, 马春波, 敖发良. Ad Hoc网络中基于树状结构的组密钥管理[J]. 计算机工程, 2010, 36(17): 179-181.
CHU Shan-Shan, MA Chun-Bei, AO Fa-Liang. Group Key Management Based on Tree Structure in Ad Hoc Networks[J]. Computer Engineering, 2010, 36(17): 179-181.