基于LKH树批量密钥更新方案的一种优化

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (4): 114-115.

基于LKH树批量密钥更新方案的一种优化

汪伟¹,张伟²

1．安徽商贸职业技术学院计算机系，安徽芜湖 241002
2．安徽师范大学数学计算机学院，安徽芜湖 241002

收稿日期:2007-09-17 修回日期:2007-11-26 出版日期:2008-02-01 发布日期:2008-02-01
通讯作者: 汪伟

Optimization design of batch rekeying scheme based on LKH

WANG Wei¹,ZHANG Wei²

1．Department of Computer，Anhui Business College of Vocational Technology，Wuhu，Anhui 241002，China
2．College of Mathematics and Computer Science，Anhui Normal University，Wuhu，Anhui 241002，China

Received:2007-09-17 Revised:2007-11-26 Online:2008-02-01 Published:2008-02-01
Contact: WANG Wei

摘要/Abstract

摘要： 基于LKH树的批量密钥更新可以有效解决实时密钥更新所产生的低效和失序等问题。文献[1]中设计一种基于LKH树的优化批量密钥更新方案，提出建立动态变动子树、增大更新路径重叠的概率来降低加密次数。对文献[1]中的优化方法进行改进，将LKH树划分为三个子树：高频变动子树、过渡子树和相对稳定子树。通过分析并比较，该方法可以进一步增大更新路径重叠概率，降低加密次数。

关键词: 批量更新, LKH树, 优化方案

Abstract: Batch rekeying based on LKH can efficiently resolve the problems，such as inefficiency and out-of-sync，produced by individual rekeying.The reference of[1] designs an optimized batch rekeying scheme based on LKH and introduces a dynamic subtree to increase the probability of update paths overlap in order to reduce the number of encryption.This paper improves on optimized scheme of the reference.Three subtrees are divided in LKH tree：high frequency，transition and relative stabilization of subtree.This scheme can further increase the probability of update paths overlap to reduce the number of encryption from analysis and compare.

Key words: batch rekeying, Logical Key Hierarchy tree, optimized scheme

汪伟¹,张伟². 基于LKH树批量密钥更新方案的一种优化[J]. 计算机工程与应用, 2008, 44(4): 114-115.

WANG Wei¹,ZHANG Wei². Optimization design of batch rekeying scheme based on LKH[J]. Computer Engineering and Applications, 2008, 44(4): 114-115.

[1]	朱晓伟，许勇，赵欢欢. 多播通信中批量密钥更新策略的研究[J]. 计算机工程与应用, 2011, 47(31): 101-103.
[2]	官孝峰,梁阿磊. 动态二进制翻译器CrossBit的性能分析与评估[J]. 计算机工程与应用, 2008, 44(27): 91-94.