计算机科学与应用

Vol.3 No.7 (October 2013)

基于LKH树和B树的组密钥管理方案
Group Key Management Based on B-Tree and LKH

 

作者:

刘迪 , 李晖 , 徐超 :北京邮电大学计算机学院,北京

周昕 :公安部第一研究所,北京

 

关键词:

多播密钥管理逻辑密钥树(LKH)单向函数(OFT)Multicast Key Management LKH Tree One-Way Function Tree

 

摘要:

已经提出的更新组密钥方法普遍存在1) 随着用户量的递增,用户需要维护的密钥数量将几何增长;2) 密钥更新过程中的加密次数多,使得更新效率低等问题。本文提出一种基于B树的LKH组密钥管理方法,使得密钥树节点可以横向递增,从而限制了树的高度,减少了需要存储的密钥数量。当加密通话组的成员关系发生变化时,本方法通过更新组密钥保证前向后向安全,从而提供一种安全的多播服务。此协议的分析结果证明,该方法可以有效的减少密钥的存储量和发送量,并提高组密钥更新效率,适用于动态大用户量加密通话组。

The existing secure group schemes had following shortages: 1) Individual has to maintain large amount of keys with increasing number of users; 2) There will be too many key renew process affecting the efficiency. This paper proposes an efficient group key management scheme based on B-Tree and LKH, which can add branches into the tree when new members join in order to impose restrictions on height of tree, and reduce the number of stored key. In this scheme, the group key will be renewed when the secure group members join or quit in order to provide a safe multicast module. This scheme overcomes the above defects and improves the performance under large group size, and could appropriately be applied on large and dynamic multicast groups.


文章引用:

刘迪 , 周昕 , 李晖 , 徐超 (2013) 基于LKH树和B树的组密钥管理方案。 计算机科学与应用, 3, 302-306. doi: 10.12677/CSA.2013.37053

 

参考文献

分享
Top