引入加入树的贡献型组密钥更新方案  

Join-tree-based contributory group key management scheme for key update

作　　者：曹震寰[1] 李黎[2] 顾小卓[3] 车彦刚[1] 

机构地区：[1]甘肃省信息中心,兰州730030 [2]甘肃省财政厅,兰州730000 [3]兰州城市学院信息工程学院,兰州730060

出　　处：《计算机应用》2011年第1期143-146,150,共5页journal of Computer Applications

摘　　要：在大规模动态群组中,一个高效的能实时更新的组密钥管理算法是提供组通信内容保护的前提。提出了一种基于加入树的分布式组播密钥管理方案JDH。首先给出了一个包含主树和加入树的新型树形结构。其次,为了降低成员加入时的时间复杂度,给出了一种新的加入算法。最后,根据最优化方法选取了最优的加入树的大小。理论分析和仿真表明,JDH将成员加入时密钥更新的时间复杂度降低为O(1)。To provide content protection in large groups with highly dynamic memberships, a secure group key management efficient in key establishment and update is the foundation. In this paper, a join-tree-based contributory group key management （JDH） was presented to achieve better time efficiency. First, a new key tree topology comprised of main tree and join tree was put forward. Then, a new join algorithm in the join tree was proposed to reduce the time complexity. Last, optimal capacity of the join tree was selected through optimization method. The theoretical analysis and simulations show that the asymptotic average join time is complexity reduced to O（1）.

关 键 词：组安全通信 贡献型组密钥管理 逻辑密钥树 

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