安全多播批量密钥更新中优化树的研究  

Study on optimal tree of BKR in secure multicast

作　　者：赵克淳[1] 许勇[1] 张伟[1] 

机构地区：[1]安徽师范大学数学计算机科学学院,安徽芜湖241000

出　　处：《计算机工程与应用》2007年第23期138-140,共3页Computer Engineering and Applications

基　　金：安徽省高校自然基金(No.2005kj009ZD)

摘　　要：LKH是安全多播密钥管理采用的一种重要方法。基于LKH的批量密钥更新进一步减少了各种开销,提高了密钥更新的效率。通过分析LKH方法在批量密钥更新中的应用特性,对现有文献中提出的LKH优化树进行了进一步的探讨,并给出了优化树的具体数学模型。实验结果表明,文中提出的数学模型对实际的安全多播应用具有指导意义。LKH is an important method adopted in group key management.h decreases the number of encryption messages in group management and the network communication overhead.BKR（Batch Key Retransmission） based on LKH further decreases all kinds of consumption,and makes the rekeying more efficient.By analyzing the applying characters of LKH in BKR and further studying the optimal tree structure put forward in current references,we have given the specific mathematical model of the optimal tree.The experimental result shows that the mathematical model presented in this paper is more efficient for practical secure muhicast.

关 键 词：安全多播 批量密钥更新 优化树 

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