An Efficient Improved Group Key Agreement Protocol Based on Diffie-Hellman Key Exchange
Traditional group key generating methods using binary-tree performs efficiently when adding or deleting nodes dynamically. However, when dealing with paroxysmal needs for group key among multi-nodes in the Internet, their time complexity grows to O (Nlog2N). We propose an improved group key agreement protocol based on Diffie-Hellman key exchange, which can reduce the time complexity of this situation to O (N). It can largely reduce overlapping computation and data packages sending times, and meanwhile, it remains binary-tree in each node, enabling it efficiently to support dynamically adding and deleting nodes as well. And then the security of this method is been analyzed and a basic idea for preventing MITM attacks is been presented.
Group key Diffie-Hellman key exchange Group Cmmunication
YANG Guang-ming CHEN Jin-ming LU Ya-feng MA Da-ming
Department of Information Security, Software School Northeastern University Shenyang 110819, R.P.Chi Dalians Net Management Center of Shenyang Branch The Electron Devices and System Engineering Compan
国际会议
The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)
沈阳
英文
303-306
2010-03-27(万方平台首次上网日期,不代表论文的发表时间)