基于逻辑密钥树的组密钥更新方案  

Group Key Update Scheme Based on Logical Key Tree

作　　者：武涛[1] 郑雪峰[2] 穆翠霞[1] 刘振华[1] 

机构地区：[1]中华女子学院计算机系,北京100101 [2]北京科技大学信息工程学院计算机系,北京100083

出　　处：《计算机工程》2010年第6期166-168,共3页Computer Engineering

摘　　要：在分析现有组密钥更新机制的基础上,提出一种基于逻辑密钥树的密钥更新方案,该方案使用单向函数、XOR运算和伪随机函数等降低存储复杂度和计算量。使用基于时间序列的组密钥增强了安全性,并引入2个变量将密钥的更新过程分为必要更新与辅助更新2个部分,减少逻辑密钥更新的次数。分析结果表明,该方案适用范围广,具有较好的鲁棒性和可扩展性。This paper proposes a novel group key update scheme based on the analysis of the existing group key schemes. It uses the one-way function, XOR operation and the pseudo-random function to reduce the storage complexity and computation, and uses the group key which is based on time series to increase security, introduces two variables which divide the key update process into two parts, the necessary update and the auxiliary update, it significantly reduces the number of logic update. Analysis shows that the robustness and scalability of the program is good and it has a widely scope of application.

关 键 词：组播通信 安全组播 组密钥更新 单向函数 异或运算 

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