期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于有根树的多点传送密钥分配技术分析 被引量：3

Analysis of the rooted-tree based multicast key distribution technique
在线阅读 下载PDF
导出
摘要 本文研究了一种多点传送中发生成员撤消时的基于有根树的密钥分配方案,分析了成员撤消事件的熵和分配给成员的最优平均密钥数量之间的关系,表明该方案在可扩展性、存储需求和通信负载之间达到了平衡。 This paper studies a rooted-tree based key distribution scheme for member revocation in multicast communication and analyzes the relation between the entropy of the member revocation event and the average optimal number of keys per member held .We show that the scheme achieves the tradeoff between the scalability, the storage requirement and the communication payload.
作者 宋晓龙 廉玉忠 吴世忠
机构地区 解放军信息工程大学 中国信息安全产品测评认证中心
出处 《通信学报》 EI CSCD 北大核心 2002年第6期110-115,共6页 Journal on Communications
基金 中国信息安全产品测评认证中心基金资助项目
关键词 有根树 多点传送 密钥分配 信息论 通信 multicast key distribution information theor
分类号 TN918 [电子电信—通信与信息系统] TP309.7 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献12

  • 1[1]HARNEY H, MUCKENHIRN C. RFC2093. Group Key Management Protocol Specification[S].1997.
  • 2[2]HARNEY H, MUCKENHIRN C. RFC2094. Group Key Management Protocol Achitecture[S].1997.
  • 3[3]KRUUS P S. A survey of multicast security issues and architectures[A]. Proceedings 21st National Information Systems Security Conference[C]. Arlington, VA,October 5-8, 1998.408-420.
  • 4[4]CANETTI R, PINKAS B. A taxonomy of Multicast Security Issues[S]. Internet-draft , 1999.04
  • 5[5]POOVENDRAN R, AHMED S, CORSON S,et al. A scalable extension of groupKey management protocol[A]. Proceedings of ATIRP Conference[C].Maryland,1998.187-191.
  • 6[6]BALLARDIE A. RFC1949. Scalable Multicast Key Distribution[S]. 1996.
  • 7[7]BALENSON D, Mcgrew D, SHERMAN A. Key Management for Large Dynamic Groups: One-Way Function Trees and Amortized Initialization[S].Internet-draft , 1999-02-26
  • 8[8]MATSUURA K, ZHENG Y L, IMAI H. Compact and flexible resolution of CBT multicast Key-distribution[A]. Proceedings of the Second International Conference on Worldwide Computing and Its Applications (WWCA'98)[C]. Lecture Notes in Computer Science, Vol. 1368, Springer-Verlag, 1998.190-205.
  • 9[9]WALLNER D M, HARDER E J, AGEE R C. Key Management for Multicast: Issues and Architectures[S]. Internet-draft , 1998.9.15.
  • 10[10]COVER T M, THOMAS J A. Elements of Information Theory[M]. Wiley Series in Telecommunications. 1992.

同被引文献27

  • 1Sriram R, Mamimaran G. Algorithms for delay-constrained low-cost multicast tree construction[ J ]. Computer Communications,1998, 21(18) : 1693-1706.
  • 2Hwang K F, Richards D S. Steiner tree problems[J]. IEEE Network, 1992, 25(1) : 55-89.
  • 3Bauer F, Varma A. Distributed algorithm for multicast path setup in data networks [ J ]. IEEE/ACM Transactions on Networking,1996, 29(2): 181-190.
  • 4Graham R L, Hell P. On the history of minimum spanning tree problem[J]. Ann. Hist. Comput, 1985, 15(7) : 43-57.
  • 5Dalil Z, Schieber B.On finding most uniform spanning trees[J]. Discrete Applied Mathematics, 1988, 20(2) : 173-175.
  • 6Hamacher H W, Ruhe G. On spanning tree problems with multiple objectives[J]. Ann. Oper. Res, 1994, 5(2) : 209-230.
  • 7Anderson K A, Jomston K. On bicriterion minimal spanning trees: An approximation[J]. Computer Ops. Res., 1996, 23(12) :1171-1182.
  • 8刘家壮 王建方.网络最优化[M].武汉:华中理工大学出版社,1986..
  • 9Sleater D D, Tarjan R E. A data structure for dynamic trees[J]. Journal of Computers and Systems Science, 1983, 26(3) : 362-391.
  • 10SRIRAM R, MAMIMARAN G. Algorithms for delay-constrained low-cost multicast tree construction[J]. Computer Communications, 1998, 21(18): 1693-1706.

引证文献3

通信学报
2002年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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