By Topic

A key distribution scheme for double authentication in link state routing protocol

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)
D. Huang ; Dept. of Comput. Sci. & Electr. Eng., Missouri Univ., Kansas City, MO, USA ; A. Sinha ; D. Medhi

The double authentication (DA) scheme presented in D. Huang et al., (2003) is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as compared to the existing schemes, such as, digital signature scheme S. Murphy et al. (1997). In this paper, we present a key distribution scheme that can be used for generating and distributing keys to provide DA. This scheme leads to a storage complexity for each router that varies linearly with the number of routers in the network in the worst case (fully connected network with n nodes). Moreover, for router with four or less average number of links, the storage complexity falls below log2n. This scheme also increases the security robustness of DA as the subverted routers can collude only if they are neighbors.

Published in:

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

Date of Conference:

7-9 April 2005