期刊文献+

安全多播中密钥更新机制的性能优化 被引量:2

Performance Optimization for Rekeying Mechanism in Secure Multicast
下载PDF
导出
摘要 针对安全多播中密钥更新的可扩展性问题,提出了一种改进的逻辑密钥分层机制.在更新密钥树时,由密钥服务器产生随机数,而多播组成员使用单向散列函数可以直接计算出变动路径中的全部或部分密钥,减少了更新密钥的计算量和在多播信道中的通信量,因此使密钥服务器的平均代价减少约1/3.在此基础上提出了适合于这种改进机制的批处理更新算法,可以对多次成员变动仅进行一次更新操作.实验分析表明,与原机制的批处理更新算法相比,该算法又可使密钥服务器的代价至少减少1/3.因此,采用这种改进机制的批处理更新算法可以进一步提高计算和通信性能. Aiming at the scalability of rekeying in secure multicast, an improved logic key hierarchy mechanism is proposed. When a key tree is updated, the key server produces random numbers, and all or the part of new keys in update paths are directly calculated by the multicast group members using one-way hash function. Therefore, the burdens of the computation and communication for updating keys through multicast channels are decreased. It is estimated that the key server's average cost can be reduced by about 1/3. A batch update algorithm is also presented in the paper based on the improved scheme, in which changing of members several times can be carried out only by update operation once. It is shown by experiments that the key server's cost of this algorithm can be reduced again at least 1/3. So the performance is further improved when this batch update algorithm is applied to the improved scheme.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2004年第10期1053-1056,共4页 Journal of Xi'an Jiaotong University
基金 国家自然科学基金资助项目 (60 1 73 0 66) 教育部"教育振兴行动计划"西安交通大学培植项目 (PZ1 2 8)
关键词 安全多播 会话密钥更新 密钥树 单向散列函数 Algorithms Cryptography Data privacy Hierarchical systems Performance Security of data
  • 相关文献

参考文献5

  • 1Wong C, Gouda M, Lam S. Secure group communication using key graphs [A]. ACM's Special Interest Group on Data Communication, Vancouver, Canada, 1998.
  • 2Li S X, Yang R Y, Gouda M G, et al. Batch rekeying for secure group communications [A]. 10th International World Wide Web Conference, Hong Kong, 2001.
  • 3Tanaka S, Sato F. A key distribution and rekeying framework with totally ordered multicast protocols [A]. 15th International Conference on Information Networking, Beppu City, Japan, 2001.
  • 4Wallner D, Harder E, Agee R. Key management for multicast: issues and architecture [EB/OL].http:∥www.faqs.org/rfcs/rfc2627.html, 2003-08-22.
  • 5Moyer M J, Rao J R, Rohatgi P. Maintaining balanced key trees for secure multicast [EB/OL]. http:∥www.securemulticast.org/draft-irtf-smug-key-tree-balance-00.txt, 2003-09-05.

共引文献1

同被引文献11

  • 1崔国华,陈莉.安全组播的动态密钥管理[J].华中科技大学学报(自然科学版),2004,32(12):40-42. 被引量:1
  • 2Li X S, Yang Y R, Gouda M G, et al. Batch rekeying for secure group communications [C]// ACM SIGCOMM 2001. [S. l].: ACM, 2001: 525-534.
  • 3Zhang X B, Lain S S, Lee D Y, et al. Protocol design for scalable and reliable group rekeying [ J]. IEEE/ACM Trans on Networking, 2003, 11 (6): 908-922.
  • 4Prathap P M J, Vasudevan V. Revised variable length interval batch rekeying with balanced key tree management for secure multicast communications [ J ]. International Journal of Computer Science and Network Security, 2008, 8(4) : 232-241.
  • 5Li Minming, Feng Ze, Zang Nan, et al. Approximately optimal trees for group key management with batch up- dates [ J]. Theoretical Computer Science, 2009, all0 (11): 1013-1021.
  • 6Gu Xiaozhuo, Yang Jianzu, Lan Julong, et al. Huffmanbased join-exit-tree scheme for contributory key management [ J ]. Computer and Security, 2009, 28 ( 1 ) : 29-39.
  • 7Ng W H D, Howarth M, Sun Z, et al. Dynamic balanced key tree management for secure multicast communications [J]. IEEE Trans on Computers, 2007, 56(5): 590- 605.
  • 8Chung Kei,Gouda M,Lam S S.Secure Group Communications Using Key Graphs[J].IEEE/ACM Transaction on Networking,2000,8(1):16-30.
  • 9Moyer M J,Rao J R,Rohatgi P.Maintaining Balanced Key Trees for Secure Multicast[EB/OL].(2003).http://www.securemulticast.org/draft irtf smug key tree balance 00.txt.
  • 10李洋,辛阳,高雪松,钮心忻,杨义先.运用PRF和XOR运算的安全组播密钥更新改进方案[J].北京邮电大学学报,2008,31(1):92-96. 被引量:1

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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