Optimal tree structure for key management of simultaneous join/leave in secure multicast

F. Zhu, Anthony K. C. Chan, G. Noubir
{"title":"Optimal tree structure for key management of simultaneous join/leave in secure multicast","authors":"F. Zhu, Anthony K. C. Chan, G. Noubir","doi":"10.1109/MILCOM.2003.1290210","DOIUrl":null,"url":null,"abstract":"As applications of secure multicast in networks continue to grow, the demand for an efficient scheme to manage group keys for secure group communication becomes more urgent. In this paper, we propose a new key tree structure for group key management. With this optimal tree structure, system resources such as network bandwidth can be saved. We devise an algorithm to generate this optimal tree and show that it can be implemented efficiently. We also design an adaptive system for group key management which consists of four components: a request receiver, a key tree update controller, a delay calculator and a request predictor. This system can maintain the optimality of the key tree dynamically. It is verified by theoretical analysis and simulation result that the performance of our scheme is better than other schemes based on traditional tree structures.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Military Communications Conference, 2003. MILCOM 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2003.1290210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

As applications of secure multicast in networks continue to grow, the demand for an efficient scheme to manage group keys for secure group communication becomes more urgent. In this paper, we propose a new key tree structure for group key management. With this optimal tree structure, system resources such as network bandwidth can be saved. We devise an algorithm to generate this optimal tree and show that it can be implemented efficiently. We also design an adaptive system for group key management which consists of four components: a request receiver, a key tree update controller, a delay calculator and a request predictor. This system can maintain the optimality of the key tree dynamically. It is verified by theoretical analysis and simulation result that the performance of our scheme is better than other schemes based on traditional tree structures.
安全组播中同时加入/离开密钥管理的最优树结构
随着安全组播在网络中的应用不断增加,对安全组播通信中有效的组密钥管理方案的需求日益迫切。本文提出了一种新的组密钥管理的密钥树结构。通过这种最优树结构,可以节省网络带宽等系统资源。我们设计了一种算法来生成这种最优树,并证明了它可以有效地实现。我们还设计了一个组密钥管理自适应系统,该系统由请求接收器、密钥树更新控制器、延迟计算器和请求预测器四个部分组成。该系统可以动态地维护键树的最优性。理论分析和仿真结果验证了该方案的性能优于基于传统树形结构的其他方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信