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

Optimization design of batch rekeying scheme based on LKH

作　　者：汪伟[1] 张伟[2] 

机构地区：[1]安徽商贸职业技术学院计算机系,安徽芜湖241002 [2]安徽师范大学数学计算机学院,安徽芜湖241002

出　　处：《计算机工程与应用》2008年第4期114-115,154,共3页Computer Engineering and Applications

基　　金：安徽省教育厅教学研究基金(No.2005364)

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

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

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