| 基于LKH树批量密钥更新方案的一种优化 |
| |
| 引用本文： | 汪伟,张伟.基于LKH树批量密钥更新方案的一种优化[J].计算机工程与应用,2008,44(4):114-115. |
| |
| 作者姓名： | 汪伟 张伟 |
| |
| 作者单位： | 1．安徽商贸职业技术学院 计算机系，安徽 芜湖 241002 2．安徽师范大学 数学计算机学院，安徽 芜湖 241002 |
| |
| 基金项目： | 安徽省教育厅教学研究项目 |
| |
| 摘 要： | 基于LKH树的批量密钥更新可以有效解决实时密钥更新所产生的低效和失序等问题。文献1]中设计一种基于LKH树的优化批量密钥更新方案，提出建立动态变动子树、增大更新路径重叠的概率来降低加密次数。对文献1]中的优化方法进行改进，将LKH树划分为三个子树：高频变动子树、过渡子树和相对稳定子树。通过分析并比较，该方法可以进一步增大更新路径重叠概率，降低加密次数。
|
| 关 键 词： | 批量更新 LKH树 优化方案 |
| 文章编号： | 1002-8331（2008）04-0114-02 |
| 收稿时间： | 2007-09-17 |
| 修稿时间： | 2007-11-26 |
Optimization design of batch rekeying scheme based on LKH |
| |
| WANG Wei,ZHANG Wei.Optimization design of batch rekeying scheme based on LKH[J].Computer Engineering and Applications,2008,44(4):114-115. |
| |
| Authors: | WANG Wei ZHANG Wei |
| |
| Affiliation: | 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 |
| |
| Abstract: | Batch rekeying based on LKH can efficiently resolve the problems,such as inefficiency and out-of-sync,produced by individual rekeying.The reference of1] 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. |
| |
| Keywords: | batch rekeying Logical Key Hierarchy tree optimized scheme |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
