CTGKD: Compressed Trie-based Group Key Distribution for Secure and Reliable Communication

S. Santhi, P.D. Sheba Kezia Malarchelvi and A. Shanmugasundaram


Group Key Management (GKM) plays a major role to achieve the secure and reliable communication among a group of users. Ensuring high security among the multicast members using the common group key is a challenging task. With the increase in group size, the number of rekeying messages either to join or leave is higher and leads to computational and communication overhead. The evolution of tree-based models addresses these limitations and provides the solution by reducing the cryptographic applications such as hashing or encryption. Key-tree approaches are used to distribute the multicast key to achieve the security with a high rekeying cost for joining and leaving operations. This paper proposes the novel Compressed Trie-based Group Key Distribution (CTGKD) protocol by applying the level and path compression on tries to reduce the rekeying cost. The compressed trie based group key distribution reduces the number of links for the transfer of messages and leads to an efficient rekeying operation. The simultaneous increase in multicast and reduction in unicast efficiently reduces the link cost and time required for communication of key. The comparative analysis between the proposed CTGKD with the existing key generation schemes regarding the parameters of key generation time, distribution time, computation time and the communication cost (number of rekeying messages required) confirms the effectiveness of CTGKD in reliable communication.

Keywords: Binary Trie, Compressed Trie, Computational Overhead, Group Key Management, Rekeying.

Volume: 5 | Issue: 1

Pages: 451-468

Paper ID : IJPPAS105105

Issue Date: February , 2017

Full Text