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.
关键词
Keywords
references
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.