Open AccessChinese remainder Theorem based centralised group key management for secure multicast communication
Author(s) -
Vijayakumar Pandi,
Bose Sudan,
Kannan Arputharaj
Publication year - 2014
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2012.0352
Subject(s) - multicast , computer science , chinese remainder theorem , key management , key (lock) , group key , communication in small groups , computation , session key , secure multicast , computer network , computational complexity theory , rekeying , theoretical computer science , distributed computing , source specific multicast , algorithm , pragmatic general multicast , computer security , encryption
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.