By Topic

An efficient improved group key agreement protocol based on Diffie-Hellman key exchange

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yang Guang-ming ; Dept. of Inf. Security, Northeastern Univ., Shenyang, China ; Chen Jin-ming ; Lu Ya-feng ; Ma Da-ming

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.

Published in:

Advanced Computer Control (ICACC), 2010 2nd International Conference on  (Volume:2 )

Date of Conference:

27-29 March 2010