By Topic

Constant-round contributory group key agreement for ad hoc networks

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
$33 $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)
Peng Zhang ; Dept. of Comput. Sci., Zhejiang Univ., Hangzhou, China ; Chengqing Ye ; Xin Li ; Yanhua Cheng
more authors

Because of the nature of ad hoc networks, protecting communication in this environment is difficult. Most existing group key management techniques are not suited to the ad hoc network environment. To overcome this problem, in this paper we propose to utilize techniques of identity-based (ID-based) cryptography and Lee's two-round contributory group key agreement to provide a mechanism that meets the following two challenges in ad hoc networks: 1, exchanged messages being authenticated without online TTP; 2, possessing some degree ability to resist unstable links. Discussion about security and robustness of our proposed scheme was given at the end of this paper.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005