基于m叉树与DH协议的组密钥协商协议  

Group Key Agreement Protocol Based on m-tree and DH Protocol

作　　者：张志军[1] 郭渊博[1] 刘伟[1] 吕金娜[2] 

机构地区：[1]解放军信息工程大学电子技术学院 [2]郑州大学河南省信息网络重点学科开放实验室

出　　处：《计算机工程》2010年第1期161-163,169,共4页Computer Engineering

基　　金：国家"863"计划基金资助项目(2007AA01Z405);国家自然科学基金资助项目(60503012)

摘　　要：为在动态对等通信环境下提高群组密钥协商的高效性与可扩展性,提出一种将m叉树结构与DH协议有机结合的组密钥协商协议。该协议与TGDH协议相比,通过采用m叉树结构,降低树的高度,减少计算量,与GDH协议相比,通过采用逐层式协商,降低通信开销。采用可变m叉树平衡该协议的计算开销与通信开销,使之同时适用广域网与局域网环境。This paper proposes a group key agreement protocol based on m-tree and DH protocol to improve the poor scalability and efficiency of most group key agreement protocols in dynamic peer communication. Compared with TGDH, this protocol reduces the depth of key tree efficiently and computing costs of group key agreement by adopting m-tree. Compared with GDH, this protocol reduces communication costs of the group key agreement through layer-by-layer agreement. Communication and computing costs are balanced by variable m-tree, which makes a great progress in applications of LAN and WAN.

关 键 词：动态对等通信 安全群组通信 组密钥协商 可证明安全性 

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