Ternary Tree based Group Key Management in Dynamic Peer Networks

For group-oriented applications, designing secure and efficient group key management schemes is a major problem. We present a group key management scheme for dynamic peer networks, which supports join, leave, merge and partition events. In the scheme, the numbers of rounds and messages are close to the lower bounds of those for dynamic group key management, and the length of messages and computation costs are less than those of the existing schemes. Furthermore, this scheme provides forward secrecy, backward secrecy and key independence