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.