Dynamic and Collaborative Group Key Generation with Quadtree-Based Queue-Batch Algorithm

Abstract

Secure communication is very much needed. Maintaining secrecy in the communication of members of a group is a must. Without Security, group communication is not preferable. In general, A secret key is used to communicate the members of any Group [1]. This secret key is called Group Key. In group communication, if we keep the same group key for a long time hackers can discover it. In this context, the secret group key has to be altered frequently. This can be done for each join operation as well as for each leave operation. We can maintain a key tree so that we can easily calculate the group key after each join or leave the event. Height of the key tree can be reduced if we use a quadtree to represent the key tree instead of a ternary tree. Rekeying time depends totally on the height of the key tree. For the same number of group members, the key tree height of quadtree is less than the key tree height of the ternary tree. We propose quadtree representation of group members so that the height is less rekeying operations will be done quickly. Here, we are going to implement quadtree-based Queue-Batch Algorithm.