An Efficient Group Key Management Scheme: Link Tree Protocol
暂无分享,去创建一个
Many group key management schemes such as those proposed by Wallner et al, Wong et al are based on a multilevel, logical hierarchy (or tree) of keyencrypting keys. But LKH is based on the hypothesis that the tree is maintained in a balanced manner. This paper proposes a multi-link tree protocol based on LKH. LTP keeps the structure balanced and has a better performance. We analyze multi-LTP and multi- LKH’s performance in detail. We prove that 3-degree LTP is the best structure among all the LTP structures, which is also better than LKH.
[1] Pingzhi Fan,et al. Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies , 2004 .
[2] Eric J. Harder,et al. Key Management for Multicast: Issues and Architectures , 1999, RFC.
[3] Mohamed G. Gouda,et al. Secure group communications using key graphs , 2000, TNET.
[4] Pankaj Rohatgi,et al. Maintaining Balanced Key Trees for Secure Multicast , 1999 .