基于Huffman单向函数树的组播密钥更新协议  

Multicast Rekeying Protocol Based on Huffman One-Way Function Tree

作　　者：祝烈煌[1] 曹元大[1] 

机构地区：[1]北京理工大学信息科学技术学院计算机科学工程系,北京100081

出　　处：《北京理工大学学报》2004年第6期524-527,540,共5页Transactions of Beijing Institute of Technology

摘　　要：在考虑组员离开通信组不同概率的基础上,提出基于Huffman单向函数树(HOFT)的组播密钥更新协议.介绍了单向函数树(OFT)组播密钥更新协议;提出了包括初始化HOFT算法以及组员加入和离开通信组时的HOFT密钥更新协议;分析了HOFT组播密钥更新协议的消息包数、组控制者保存的密钥数以及组员保存的密钥数等,研究表明,在所有基于OFT的组播密钥更新协议中,HOFT组播密钥更新协议的平均性能最优.Considering the difference in probability of various members leaving the communication group the paper proposes a new multicast rekeying protocol based Huffman one-way function tree (HOFT). The paper introduces the OFT multicast rekeying protocol, proposes the HOFT multicast rekeying protocol including the HOFT initialization algorithm and the HOFT multicast rekeying protocol when a member adds to or leaves the communication group. The paper then analyzes the performance of the HOFT multicast rekeying protocol on the number of rekeying messages and the number of keys the GC and member should save. Average performance of the HOFT multicast rekeying protocol appears to be the best among all the multicast rekeying protocols based on OFT.

关 键 词：组播 密钥更新 哈夫曼 单向函数树 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]