By Topic

KAP-AOT: A Novel Group Key Agreement Protocol Based on Considering Nodes' Average Online Time

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

5 Author(s)

An effective group key agreement protocol is important for group-oriented applications. Some key tree approaches have been proposed by other researchers. The rekey cost of some of them scales with the logarithm of the group size for a join or leaving request, in which TGDH (tree based group Diffie-Hellman) is considered as one of the most effective and secure protocols. But the rekey cost is still considerable when the group size is very large and with nodes' frequent joining and leaving (churn problem). In this paper, we present a novel group key agreement protocol KAP-AOT improved on TGDH protocol. Our protocol takes nodes' average online time into consideration and is proved to be able to further reduce computation overhead of the rekey process.

Published in:

Grid and Cooperative Computing, 2008. GCC '08. Seventh International Conference on

Date of Conference:

24-26 Oct. 2008