检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李洋[1] 杨亚涛[1,2] 辛阳[1] 杨义先[1] 李忠献[1,3]
机构地区:[1]北京邮电大学灾备技术国家工程实验室,北京100876 [2]北京电子科技学院,北京100070 [3]天津市国瑞数码安全系统有限公司北京研发中心,北京100088
出 处:《武汉理工大学学报》2008年第12期98-102,共5页Journal of Wuhan University of Technology
基 金:国家“973”项目(2007CB310704);国家“863”项目(2006AA01Z456);高等学校学科创新引智计划(B08004);北京电子科技学院信息安全与保密重点实验室资助项目
摘 要:该文提出了一种组播组内多个组播会话共享密钥树的密钥更新方案,使更新开销与组播会话数量无关,有效解决具有多个组播会话组播组的密钥更新效率低下的问题。该方案中组成员的私密钥作为共享密钥树的叶节点,组播会话的组密钥作为共享密钥树的扩展根节点。该方案采用的密钥更新算法利用PRF和XOR运算生成更新密钥和密钥更新数据。Linux下原型机系统的仿真结果表明,该方案较传统方案明显的提高了组播组内多个组播会话的通信场景下密钥更新的性能。A re-keying solution using shared key tree among multicast sessions in same multicast group was presented in this paper to make re-keying cost be independent of multicast sessions amount, and solve the problem that group with multiple sessions had low efficiency when key was updated. In this solution, leaves and extended root nodes in shared key tree respectively contained private keys of group members and group keys of multieast sessions. According to the key update algorithm used in this solution, updated keys and re-keying data were generated by PRF and XOR operations together. The simulation results of prototype system under Linux show that this solution obviously improves re-keying performance to some extent under communication circumstance with multiple sessions in same group compared to conventional solution.
关 键 词:安全组播 密钥管理 密钥更新 共享密钥树 扩展根节点
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31