批量密钥更新中密钥树的概率组织方法研究  

Study on Probabilistic Organization of Key Tree in Batch Group Rekeying

作　　者：赵克淳[1] 许勇[1] 张伟[1] 

机构地区：[1]安徽师范大学数学计算机科学学院,安徽芜湖241000

出　　处：《计算机技术与发展》2007年第12期140-143,共4页Computer Technology and Development

基　　金：安徽省高校自然科学基金重点项目(2005KJ009ZD)

摘　　要：可缩放组密钥更新是大型动态组通信需要面对的一个重要问题。当前,最有效的组管理技术是基于LKH机制的,且LKH树通常被组织成平衡二叉树。在对批量密钥更新和成员行为进行分析的基础上,结合星型结构和树型结构,给出了一种密钥树的概率组织方法。该方法基于成员的变动概率将其分类,每类关联一棵最优子树,从而进一步减小了密钥更新开销,较好地解决了多播组中异构成员变化带来的组密钥更新问题。实验结果表明,密钥树的概率组织方法显著优于平衡二叉树,且更具有一般意义。Scalable group rekeying is one of the biggest challenges that need to be addressed to support secure communications for large and dynamic groups. Currently, the most efficient techniques for multicast key management are based on the logical key hierarchy （LKH） scheme and LKH trees are always organized as balanced binary trees. Based on batch group rekeying and group member＇s behavior, propose a new method： probabilistic organization of the key tree, combining star structure and tree structure. The method classifies the members based on their changing probability and each class corresponds to an optimal tree, so it further decreases the rekeying overhead. The method can solve much better the problemof group rekeying with heterogeneous group members. Simulation results show that the method is more generalizing than others.

关 键 词：安全多播 批量密钥更新 密钥树 概率组织 

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