Distribution function based efficient secure group communication using key tree

There are many applications such as a messaging application, teleconferencing, information service etc. which use a group communication model that provides confidentiality, integrity and authenticity of the messages sent over the group. Thus, it results in a secure group communication. The most important part in deploying a secure group communication model is to reduce the number of encryption and rekeying operations. Most of the known algorithm uses LKH (logical key hierarchy) based protocol in which a key tree or graph is created in hierarchical manner that will be used to multicast the messages at a cost of O(log n), where n is the number of members in the group. Almost all the methods introduced till now are not taking full advantage of the key tree they were mainly concentrated on minimizing the rekeying operations after a leave or a join in the group. We have proposed a simple and elegant method that is based on a distribution function F(S) to multicast the messages to a subset of n members of the group G. Our method takes the full advantage of the key tree, It minimizes the rekey operations with minimum time complexity and also maintain the security requirements for the secure group communication.