On providing confidentiality in link state routing protocol

Dijiang Huang, Amit Sinha, Deep Medhi

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

1 Citation (Scopus)

Abstract

In current network routing domains, routing information exchange usually lacks protection based on confidentiality. This makes network routing vulnerable to a variety of security attacks. In this paper, we present a framework to provide confidentiality for a link state routing protocol. This framework involves creation of a trust structure among routers as well as key management. Routing information is encrypted so that it can be accessed only by authorized routers. We present an implementation framework for our approach by extending Open Shortest Path First (OSPF), a commonly deployed link-state routing protocol. Based on our performance assessment, we have found that the additional cost in implementing our scheme has fairly moderate impact on the overall performance.

Original languageEnglish (US)
Title of host publication2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
Pages671-675
Number of pages5
Volume2
DOIs
StatePublished - 2006
Event2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006 - Las Vegas, NV, United States
Duration: Jan 8 2006Jan 10 2006

Other

Other2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
CountryUnited States
CityLas Vegas, NV
Period1/8/061/10/06

Fingerprint

Network routing
Routing protocols
Routers
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Huang, D., Sinha, A., & Medhi, D. (2006). On providing confidentiality in link state routing protocol. In 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006 (Vol. 2, pp. 671-675). [1593122] https://doi.org/10.1109/CCNC.2006.1593122

On providing confidentiality in link state routing protocol. / Huang, Dijiang; Sinha, Amit; Medhi, Deep.

2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006. Vol. 2 2006. p. 671-675 1593122.

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

Huang, D, Sinha, A & Medhi, D 2006, On providing confidentiality in link state routing protocol. in 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006. vol. 2, 1593122, pp. 671-675, 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006, Las Vegas, NV, United States, 1/8/06. https://doi.org/10.1109/CCNC.2006.1593122
Huang D, Sinha A, Medhi D. On providing confidentiality in link state routing protocol. In 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006. Vol. 2. 2006. p. 671-675. 1593122 https://doi.org/10.1109/CCNC.2006.1593122
Huang, Dijiang ; Sinha, Amit ; Medhi, Deep. / On providing confidentiality in link state routing protocol. 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006. Vol. 2 2006. pp. 671-675
@inproceedings{d801ed48c4ca476e93fdd10cebb35d04,
title = "On providing confidentiality in link state routing protocol",
abstract = "In current network routing domains, routing information exchange usually lacks protection based on confidentiality. This makes network routing vulnerable to a variety of security attacks. In this paper, we present a framework to provide confidentiality for a link state routing protocol. This framework involves creation of a trust structure among routers as well as key management. Routing information is encrypted so that it can be accessed only by authorized routers. We present an implementation framework for our approach by extending Open Shortest Path First (OSPF), a commonly deployed link-state routing protocol. Based on our performance assessment, we have found that the additional cost in implementing our scheme has fairly moderate impact on the overall performance.",
author = "Dijiang Huang and Amit Sinha and Deep Medhi",
year = "2006",
doi = "10.1109/CCNC.2006.1593122",
language = "English (US)",
isbn = "1424400856",
volume = "2",
pages = "671--675",
booktitle = "2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006",

}

TY - GEN

T1 - On providing confidentiality in link state routing protocol

AU - Huang, Dijiang

AU - Sinha, Amit

AU - Medhi, Deep

PY - 2006

Y1 - 2006

N2 - In current network routing domains, routing information exchange usually lacks protection based on confidentiality. This makes network routing vulnerable to a variety of security attacks. In this paper, we present a framework to provide confidentiality for a link state routing protocol. This framework involves creation of a trust structure among routers as well as key management. Routing information is encrypted so that it can be accessed only by authorized routers. We present an implementation framework for our approach by extending Open Shortest Path First (OSPF), a commonly deployed link-state routing protocol. Based on our performance assessment, we have found that the additional cost in implementing our scheme has fairly moderate impact on the overall performance.

AB - In current network routing domains, routing information exchange usually lacks protection based on confidentiality. This makes network routing vulnerable to a variety of security attacks. In this paper, we present a framework to provide confidentiality for a link state routing protocol. This framework involves creation of a trust structure among routers as well as key management. Routing information is encrypted so that it can be accessed only by authorized routers. We present an implementation framework for our approach by extending Open Shortest Path First (OSPF), a commonly deployed link-state routing protocol. Based on our performance assessment, we have found that the additional cost in implementing our scheme has fairly moderate impact on the overall performance.

UR - http://www.scopus.com/inward/record.url?scp=33749067601&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749067601&partnerID=8YFLogxK

U2 - 10.1109/CCNC.2006.1593122

DO - 10.1109/CCNC.2006.1593122

M3 - Conference contribution

AN - SCOPUS:33749067601

SN - 1424400856

SN - 9781424400850

VL - 2

SP - 671

EP - 675

BT - 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006

ER -