期刊文献+

安全多播批量密钥更新中优化树的研究

Study on optimal tree of BKR in secure multicast
下载PDF
导出
摘要 LKH是安全多播密钥管理采用的一种重要方法。基于LKH的批量密钥更新进一步减少了各种开销,提高了密钥更新的效率。通过分析LKH方法在批量密钥更新中的应用特性,对现有文献中提出的LKH优化树进行了进一步的探讨,并给出了优化树的具体数学模型。实验结果表明,文中提出的数学模型对实际的安全多播应用具有指导意义。 LKH is an important method adopted in group key management.h decreases the number of encryption messages in group management and the network communication overhead.BKR(Batch Key Retransmission) based on LKH further decreases all kinds of consumption,and makes the rekeying more efficient.By analyzing the applying characters of LKH in BKR and further studying the optimal tree structure put forward in current references,we have given the specific mathematical model of the optimal tree.The experimental result shows that the mathematical model presented in this paper is more efficient for practical secure muhicast.
出处 《计算机工程与应用》 CSCD 北大核心 2007年第23期138-140,共3页 Computer Engineering and Applications
基金 安徽省高校自然基金(No.2005kj009ZD)
关键词 安全多播 批量密钥更新 优化树 secure muhicast Batch Key Retransmission(BKR) optimal key tree
  • 相关文献

参考文献5

  • 1Zhu Fen,Chan A,Noubir G.Optimal tree structure for key management of simultaneous joinileave in secure multicast[C]//Military Communications Conference 2003:773-778.
  • 2Chung Kei Wong,Gouda M,Lam S S.Secure group communications using key graphs[J].IEEE/ACM Transactions on Networking,2000,8(1):16-30.
  • 3Li Xiao-zhou,Yang R Yang,Gouda M,et al.Batch rekeying for secure group communications.WWW10,May 1-5,2001,Hong Kong,ACM 1-58113-348-0/01/0005,2001:525-534.
  • 4张斌,邬江兴.组播安全中的组密钥更新问题[J].计算机科学,2001,28(9):45-47. 被引量:3
  • 5许勇.安全多播密钥更新研究[D].东南大学,2004.

二级参考文献6

  • 1[1]Wallner D,Harder E,Agee R. Key Management for Multicast: Issues and Architectures. RFC2617,1999
  • 2[2]Harney H,Muckenhirn C. Group Key Management Protocol(GKMP) Specification. RFC2093,1997
  • 3[3]Ballardie A. Scalable Multicast Key Distribution.RFC1949,1996
  • 4[4]Mittra S. Iolus: A Framework for Scalable Secure Multicasting. Proc. ACM SIGCOMM, 1997
  • 5[5]Wong C K,Gouda M, Lam S S. Secure Group Communiations Using Key Graphs. Proc. ACM SIGCOMM, 1998
  • 6[6]Blum M, Micali S. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. on Comp.,1984

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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