论文部分内容阅读
利用Huffman树来实现组密钥更新具有平均更新开销最小的优势.针对现有方案中Huffman树只能静态创建,而无法动态调整的问题,提出了一种根据用户进出组的频率而动态调整的自适应Huffman树算法;同时,提出了自适应调整过程中的节点位置交换密钥更新算法,并给出了用户加入或离开时的组密钥更新算法.分析表明,该方案能保证组密钥更新的安全性,当用户进出组时,树的形状随着用户的进出而动态变化,并能始终保持Huffman树用户平均密钥更新代价最小.
Huffman tree to achieve the group key update with the average update overhead minimum advantage.Aiming at the problem that the Huffman tree can only be created statically and can not be dynamically adjusted in the existing scheme, Adaptive Huffman tree algorithm is proposed.At the same time, an algorithm of node location exchange key update in adaptive adjustment process is proposed, and the algorithm of group key update when users join or leave is given.The analysis shows that this scheme can guarantee the group key Updated security, the shape of the tree dynamically changes as the user moves in and out of the group, and always keeps the Huffman Tree user’s average key update cost at a minimum.