自适应Huffman树组密钥更新方案  

Adaptive Huffman tree scheme for multicast rekeying

作　　者：谢海涛[1] 王玉明[1] 杨宗凯[1] 徐守志[2] 

机构地区：[1]华中科技大学电子与信息工程系,湖北武汉430074 [2]三峡大学电气信息学院,湖北宜昌443002

出　　处：《华中科技大学学报（自然科学版）》2009年第9期33-36,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60572049)

摘　　要：利用Huffman树来实现组密钥更新具有平均更新开销最小的优势.针对现有方案中Huffman树只能静态创建,而无法动态调整的问题,提出了一种根据用户进出组的频率而动态调整的自适应Huffman树算法;同时,提出了自适应调整过程中的节点位置交换密钥更新算法,并给出了用户加入或离开时的组密钥更新算法.分析表明,该方案能保证组密钥更新的安全性,当用户进出组时,树的形状随着用户的进出而动态变化,并能始终保持Huffman树用户平均密钥更新代价最小.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.

关 键 词：组密钥更新 HUFFMAN树 节点位置交换 钿权路径长度 平均密钥更新代价 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]