Performance analysis of batch rekey algorithm for secure group communications

Authors:
Jun Zhang;Fanyuan Ma;Yingcai Bai;Minglu Li
Affiliations:
Department of compute Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of compute Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of compute Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of compute Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 3
Cited 0

Secure group communications using key graphs

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Batch rekeying for secure group communications

Proceedings of the 10th international conference on World Wide Web
The VersaKey framework: versatile group key management

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.