检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许勇[1]
机构地区:[1]安徽师范大学数学计算机学院,芜湖241000
出 处:《东南大学学报(自然科学版)》2006年第3期488-492,共5页Journal of Southeast University:Natural Science Edition
基 金:安徽省教育厅自然科学基金重点资助项目(2005KJ009ZD)
摘 要:在对批量密钥更新和成员行为进行分析的基础上,对现有的优化密钥树结构进行了优化,并给出了一种实现方法.该方法基于Huffman树的构造方法,将组成员的变化概率与成员所在的密钥树级别进行关联,形成多级密钥树,最低级别密钥树高度为1.成员变化概率越大,所在的密钥树级别越低.当成员变化概率发生动态改变时,成员的位置也可随之更改.这种方法较好地解决了多播组中异构成员变化带来的组密钥更新问题.仿真实验结果表明,提出的优化树结构更具有一般意义,可适应具有较大动态变化情形的安全多播密钥更新.Based on batch group rekeying and group members' behavior, a new method which optimizes the current key tree structure is proposed. The method is based on the extending of traditional Huffman tree. it expands the group member's model of uniform probability to a diverse one, and establishes the relationship of member change probability with one of the multi-lever-key trees. The height of the lowest tree is 1. The bigger the probability of a member, the lower the tree height in it. When members' probabilities change, their locations can be changed afterwards. The method can solve the problem of group rekeying with heterogeneous group members. Simulation results show that the method is more generalizing than others and is more adaptive to secure multicast group with various group behaviors.
分 类 号:TP393.3[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15