西安通信学院网络安全与对抗研究室,西安,710106
网络首发:2009-12-10,
纸质出版:2009
移动端阅览
李波 1, 潘进 1, 付颖 2, 等. 一种新的动态批密钥更新算法[J]. 西安交通大学学报, 2009,43(12):65-69.
A Novel Dynamic Batch Rekeying Algorithm[J]. 2009, 43(12): 65-69.
针对传统单次密钥更新方法存在低效、资源浪费、数据和密钥不同步等问题
提出了一种基于密钥树的批密钥更新算法.通过2种方法保持密钥树的平衡:利用加入节点替代离开节点的位置来保持树的结构不变; 搜索密钥树中高度最低的节点
然后根据该节点的类型及剩余的可加入节点数
将适量的节点加入到高度最低节点的位置.同时
对服务器的更新开销进行了理论分析
建立了用于计算开销的精确数学模型.仿真实验表明
与单次密钥更新方法相比
所提算法可以将更新开销减少74.6%
显著提高更新效率
并适合于大型动态群组的应用.
Aiming at the problems that the traditional individual rekeying approach is inefficient
waste of resources
and out-of-sync between keys and data
a novel batch algorithm for renewing keys is proposed based on a key tree. In the new algorithm
the key tree is kept balanced by two methods: departed nodes are replaced by joining nodes to keep the structure of the tree unchanged; the node with the smallest height in the tree is searched
and then a proper number of joining nodes are added to the node place based on the type of the node and the number of the remaining nodes to be joined. The cost of renewing servers' keys is analyzed theoretically
and accurate mathematical models are established to calculate the cost. Simulation results and comparison with the individual rekeying approach show that the proposed algorithm decreases the rekeying cost by 74.6% and improves the efficiency of rekeying significantly
and that the algorithm is suitable for large dynamic groups.
JUDGE P, AMMAR M. Security issues and solutions in multicast content distribution: a survey [J]. IEEE Network, 2003(1/2): 30-36.
LI Xiaozhou, YANG R, GOUDA M G, et al. Batch rekeying for secure group communications[C]∥Proceedings of 10th International World Wide Web Conference. New York, USA: ACM, 2001: 525-534.[3] ZHANG X B, LAM S S, LEE D Y, et al. Protocol design for scalable and reliable group rekeying[J]. IEEE/ACM Trans on Networking, 2003, 11(12): 908-922.
PEGUEROLES J, RICO-NOVELLA F. Balanced batch LKH: new proposal, implementation and performance evaluation [C]∥Proceedings of IEEE Symp Computers and Communacations. Piscataway, NJ, USA: IEEE, 2003: 815-820.
NG W H D, CRUICKSHANK H, SUN Z. Scalable balanced batch rekeying for secure group communication [J]. Elsevier Computers and Security, 2006, 25(2): 265-273.
PHAM T, WATTERS P A. The efficiency of periodic rekeying in dynamic group key management [C]∥Proceedings of the 4th European Conference on Universal Multiservice Networks.Piscataway, NJ, USA: IEEE, 2007: 425-432.
NG W H D, HOWARTH M, SUN Z, et al. Dynamic balanced key tree management for secure multicast communications[J]. IEEE Trans on Computers, 2007, 56(5): 590-605.
PRATHAP P M J, VASUDEVAN V. Revised variable length interval batch rekeying with balanced key tree management for secure multicast communications[J]. International Journal of Computer Science and Network Security, 2008, 8(4): 232-241.
JENCHIUN L, CHIENHUA T, FEIPEI L. Optimizing centralized secure group communications with binary key tree recomposition[C]∥Proceedings of the 18th International Conference on Advanced Information Networking and Applications. Los Alamitos, CA, USA: IEEE Computer Society, 2004: 202-207.
KWAK D W, LEE J S, KIM J W, et al. An efficient LKH tree balancing algorithm for group key management [J]. IEEE Communication Letters, 2006, 10(3): 222-224.
VARTHINI B P, VALLI S. An efficient group rekeying method using enhanced one way function tree protocol [J]. International Journal of Computer Science and Network Security, 2006, 6(12): 211-218.
0
浏览量
4
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621