科研之友
微信
新浪微博
Facebook
分享链接
摘要
Huffman key tree scheme has least average cost for multicast rekeying, but Huffman key tree can';t be adjusted dynamically and be statically established in current scheme. An adaptive Huffman key tree scheme for multicast but rekeying was proposed in which the structure of Huffman key tree could be adjusted adaptively with the frequency of users joining in or leaving from multicast group before now, then rekeying arithmetic for node position exchange and member join or leave was proposed respectively. The analysis proved that the scheme can provide the security of multicast rekeying, as well as can ensure that the average cost of rekeying be minimum even when adjusting Huffman key tree dynamically.
