基于二分图的组密钥管理方案设计  

Design of Group Key Management Scheme Based on Bipartite Graph

作　　者：周杰[1] 饶艳芬[1] 李慧芬[1] 

机构地区：[1]华南理工大学广东省计算机网络重点实验室,广州510641

出　　处：《计算机科学》2009年第4期101-104,124,共5页Computer Science

基　　金：国家973计划项目(2003CB314805);国家CNGI项目(CNGI-04-13-2T)资助

摘　　要：随着基于群组通信应用的不断发展,安全群组通信成为目前分布式计算领域和信息安全领域研究的一个热点问题。有效的组密钥管理是安全群组通信需要解决的关键问题。将一个安全群组通信系统中组成员拥有的辅助密钥与组成员之间的关系用一个二分图表示,将设计组密钥管理方案问题转化为构造满足一定条件的二分图的问题,为设计组密钥管理方案提供了一种新途径。利用构造的二分图设计了一种组密钥管理方案。所设计的组密钥管理方案不需要组管理中心保存树或矩阵等结构,因而降低了组管理中心的存储开销,另外避免了类似LKH方案中维持平衡树的开销。With the development of application based on group communication, secure group communication has become a hot topic of current distributed computing and information security field. Efficient group key management is the key problem to be resolved by secure group communication. This paper used a bipartite graph to express the relation between the assistant keys owed by members and members in the secure group communication system, transformed the problem of designing group key management scheme into the problem of constructing a bipartite graph which satisfies certain conditions. This provided a new way to design group key management scheme. The paper designed a group key management with the constructed bipartite graph. There is no need for the scheme to use group center to save trees or matrix. So it can reduce the storage cost of GC（Group Center） ,and can avoid the cost of keeping balanced tree such as LKH scheme.

关 键 词：安全群组通信系统 组密钥管理 辅助密钥 二分图 

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