By Topic

Key management in wireless ad hoc networks: collusion analysis and prevention

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

3 Author(s)
M. Younis ; Dept. of Comput. Sci. & Elect. Eng., Maryland Univ., Baltimore, MD, USA ; K. Ghumman ; M. Eltoweissy

Due to the dynamic nature of wireless ad-hoc networks (WAHNs) and the multi-node involvement in most WAHN applications, group key management has been proposed for efficient support of secure communications. Exclusion basis systems (EBS) provide a framework for scalable and efficient group key management where the number of keys per node and the number of re-key messages can be relatively adjusted. EBS-based solutions, however, may suffer from collusion attacks, where a number of nodes may collaborate to reveal all system keys and consequently capture the network. In this paper we investigate the collusion problem in EBS and demonstrate that a careful assignment of keys to nodes reduces collusion. Since an optimal assignment is NP hard, we propose a location-based heuristic where keys are assigned to neighboring nodes depending on the Hamming distance between the strings of bits representing the used subset of the keys.

Published in:

PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005.

Date of Conference:

7-9 April 2005