Performance Analysis of Batch Rekey Algorithm for Secure Group Communications
The efficiency of rekeying is a main factor that influences the performance of secure group communications. Periodic batch rekeying for users join/leave is an effective way to improve the efficiency of rekeying. In this paper, we introduce queue theory into the batch rekey algorithm, and construct a model of batch rekey algorithm based on the queue theory. We then analyze the performance influence of the parameters—rekeying periods and the degree of key tree. Finally, we found 3-degree key tree is the best structure for the batch rekey algorithm, and we also analyze the reason why it is not consistent with the result before.
Unable to display preview. Download preview PDF.
- 1.Waldvogel, M., Caronni, G., Sun, D., Weiler, N., Plattner, B.: The VersaKey Framework: Versatile Group Key Management. IEEE Journal on Selected Areas in Communications 17(8) (August 1999)Google Scholar
- 2.Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. RFC 2627 (1999)Google Scholar
- 3.Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. In: ACM SIGCOMM (1998)Google Scholar
- 4.Li, X.S., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch Rekeying for Secure Group Communications. In: Proceedings of 10th International WWW Conference, Hong Kong, China, May 2001, pp. 525–534 (2001)Google Scholar