首页 | 本学科首页   官方微博 | 高级检索  
     

批量密钥更新中密钥树的概率组织方法研究
引用本文:赵克淳,许勇,张伟.批量密钥更新中密钥树的概率组织方法研究[J].微机发展,2007,17(12):140-143.
作者姓名:赵克淳  许勇  张伟
作者单位:安徽师范大学数学计算机科学学院 安徽芜湖241000
基金项目:安徽省高校自然科学基金重点项目(2005KJ009ZD)
摘    要:可缩放组密钥更新是大型动态组通信需要面对的一个重要问题。当前,最有效的组管理技术是基于LKH机制的,且LKH树通常被组织成平衡二叉树。在对批量密钥更新和成员行为进行分析的基础上,结合星型结构和树型结构,给出了一种密钥树的概率组织方法。该方法基于成员的变动概率将其分类,每类关联一棵最优子树,从而进一步减小了密钥更新开销,较好地解决了多播组中异构成员变化带来的组密钥更新问题。实验结果表明,密钥树的概率组织方法显著优于平衡二叉树,且更具有一般意义。

关 键 词:安全多播  批量密钥更新  密钥树  概率组织
文章编号:1673-629X(2007)12-0140-04
修稿时间:2007年3月6日

Study on Probabilistic Organization of Key Tree in Batch Group Rekeying
ZHAO Ke-chun,XU Yong,ZHANG Wei.Study on Probabilistic Organization of Key Tree in Batch Group Rekeying[J].Microcomputer Development,2007,17(12):140-143.
Authors:ZHAO Ke-chun  XU Yong  ZHANG Wei
Abstract: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.
Keywords:secure multicast  batch group rekeying  key tree  probabilistic organization
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号