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

Dijiang Huang, Amit Sinha, Deep Medhi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

The Double Authentication (DA) scheme presented in [1] 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 [2]. 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 log2 n. This scheme also increases the security robustness of DA as the subverted routers can collude only if they are neighbors.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
EditorsT. Dahlberg, R. Oliver, A. Sen, G. Xue
Pages19-24
Number of pages6
StatePublished - 2005
Externally publishedYes
Event24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States
Duration: Apr 7 2005Apr 9 2005

Other

Other24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
Country/TerritoryUnited States
CityPhoenix, AZ
Period4/7/054/9/05

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'A key distribution scheme for double authentication in link state routing protocol'. Together they form a unique fingerprint.

Cite this