安全组播中的密钥树最优结构  

Optimal Key Tree Structure in Secure Multicast

作　　者：刘小虎[1,2] 顾乃杰[1,2] 陆余良[3] 毕坤[1,2] 任开新[1,2] 

机构地区：[1]中国科学技术大学计算机科学与技术系 [2]安徽省计算与通信软件重点实验室,安徽合肥230027 [3]解放军电子工程学院网络工程教研室

出　　处：《小型微型计算机系统》2006年第12期2272-2275,共4页Journal of Chinese Computer Systems

基　　金：安徽省自然科学基金资助项目(03042210)资助.

摘　　要：组播常用来对一组用户发送数据.为了保障安全性,安全组播使用组内共享的加密密钥对组内通信进行加密.因为组成员关系的动态性,有效进行组密钥管理成为安全组播通信性能的关键.本文研究了组密钥管理的密钥树结构,并提出了一种新的基于组成员更新概率的最优密钥树结构.这种结构能够进一步减少系统开销.实验结果表明这种密钥树结构要优于其它基于组成员更新概率的密钥树结构,同时理论分析给出了这种结构的平均更新代价的取值范围.Multicast is often used to deliver packets to a group of users. To ensure security, a group key is used in secure multicast to encrypt group communication. Because of the dynamic group membership, the performance of key management becomes the core factor of secure multicast. This paper investigates key tree structure for group key management and proposes a new optimal key tree structure based on member updating probabilities. With this optimal tree structure, system costs can be properly reduced. It is verified by the experiment results that this key tree structure is better tb, an other key tree structures based on member updating probabilities, and the bounds of this structure＇s average updating cost are analyzed.

关 键 词：安全组播 密钥树 重发密钥 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]