Chinese remainder Theorem based centralised group key management for secure multicast communication. Issue 3 (1st May 2014)

• Record Type: Journal Article
• Authors: Vijayakumar, Pandi; Bose, Sudan; Kannan, Arputharaj
• Is Part Of: IET information security. Volume 8:Issue 3(2014)
• Page Start: 179
• Page End: 187
• Publication Date: 2014-05-01
• Subjects: communication complexity -- multicast communication -- multimedia communication -- telecommunication security; Chinese remainder theorem -- centralised group key management -- secure multimedia multicast communication -- computation complexity; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2012.0352
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : Designing a centralised group key management with minimal computation complexity to support dynamic secure multicast communication is a challenging issue in secure multimedia multicast. In this study, the authors propose a Chinese remainder theorem‐based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O (1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimised by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The proposed algorithm has been implemented and tested using a key‐star‐based key management scheme and has been observed that this proposed algorithm reduces the computation complexity significantly.