期刊文献+

安全组播中的密钥树最优结构

Optimal Key Tree Structure in Secure Multicast
下载PDF
导出
摘要 组播常用来对一组用户发送数据.为了保障安全性,安全组播使用组内共享的加密密钥对组内通信进行加密.因为组成员关系的动态性,有效进行组密钥管理成为安全组播通信性能的关键.本文研究了组密钥管理的密钥树结构,并提出了一种新的基于组成员更新概率的最优密钥树结构.这种结构能够进一步减少系统开销.实验结果表明这种密钥树结构要优于其它基于组成员更新概率的密钥树结构,同时理论分析给出了这种结构的平均更新代价的取值范围. Multicast is often used to deliver packets to a group of users. To ensure security, a group key is used in secure multicast to encrypt group communication. Because of the dynamic group membership, the performance of key management becomes the core factor of secure multicast. This paper investigates key tree structure for group key management and proposes a new optimal key tree structure based on member updating probabilities. With this optimal tree structure, system costs can be properly reduced. It is verified by the experiment results that this key tree structure is better tb, an other key tree structures based on member updating probabilities, and the bounds of this structure's average updating cost are analyzed.
出处 《小型微型计算机系统》 CSCD 北大核心 2006年第12期2272-2275,共4页 Journal of Chinese Computer Systems
基金 安徽省自然科学基金资助项目(03042210)资助.
关键词 安全组播 密钥树 重发密钥 secure multicast key tree rekey
  • 相关文献

参考文献4

二级参考文献19

  • 1周炯磐 丁小明.信源编码理论[M].北京:人民邮电出版社,1996..
  • 2[1]Culler D E, Karp R M, Patterson D A et al.LogP: Towards a realistic model of parallel computation. In: Proc 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, 1993.1-12
  • 3[2]Message Passing Interface Forum. MPI: A message-passing interface standard. International Journal of Supercomputer Applications, 1994, 8(3-4):165-414
  • 4[3]Kesavan R, Bondalapati K, Panda D K. Multicast on irregular switch-based networks with wormhole routing. In: Proc the International Symposium on High Performance Computer Architecture (HPCA-3), San Antonio, TX, USA, 1997.48-57
  • 5[4]Kesavan R, Panda D K. Multiple multicast with minimized node contention on wormhole k-ary n-cube networks. IEEE Trans Parallel and Distributed Systems, 1999, 10(4):371-393
  • 6[5]Lin X, Ni L M. Deadlock-free multicast wormhole routing in multicomputer networks. In:Proc the International Symposium on Computer Architecture, 1991.116-124
  • 7[6]Boppana R V, Chalasani S, Raghavendra C S. Resource deadlocks and performance of wormhole multicast routing algorithms. IEEE Trans Parallel and Distributed Systems, 1998,9(6):535-549
  • 8[7]Chiu G-M, Hsiao C-M. A note on total ordering multicast using propagation trees. IEEE Trans Parallel and Distributed Systems, 1998,9(2):217-223
  • 9[8]McKinley P K, Xu H, Esfahanian A-H et al. Unicast-based multicast communication in wormhole-routed networks. IEEE Trans Parallel and Distributed Systems, 1994, 5(12):1252-1265
  • 10[9]Graham R L, Knuth D E, Patashink O. Concrete Mathematics. Massachusetts: Addison-Wesley, 1994

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部