New solution for the problem of the dynamic nature of group members in multicast communication

Solving the problem of dynamic nature of the multicast communication is always a challenging task. According to the key management problem in multicast, there are many protocols that try to get an optimized solution to this problem. When anyone deals with this problem he tries to minimize the number of update messages. The number of update messages is the factor which affects the bandwidth of the system. So from this last point we start. This paper deals with the group key management system in multicast communication. In this paper, we try to get a new optimized scheme. To lighten the scalability problem, a key tree structure was proposed. Our scheme decreases the number of symmetric operations needed for a new join member operation, which means less management overhead. The system be stable in less time, and satisfy forward and backward secrecy in faster time.