On providing confidentiality in link state routing protocol

Dijiang Huang; Amit Sinha; Deep Medhi

doi:10.1109/CCNC.2006.1593122

On providing confidentiality in link state routing protocol

Dijiang Huang, Amit Sinha, Deep Medhi

IAFSE-CIDSE: Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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 language	English (US)
Title of host publication	2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
Pages	671-675
Number of pages	5
DOIs	https://doi.org/10.1109/CCNC.2006.1593122
State	Published - Oct 3 2006
Event	2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006 - Las Vegas, NV, United States Duration: Jan 8 2006 → Jan 10 2006

Publication series

Name	2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
Volume	2

Other

Other	2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
Country	United States
City	Las Vegas, NV
Period	1/8/06 → 1/10/06

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/CCNC.2006.1593122

Fingerprint Dive into the research topics of 'On providing confidentiality in link state routing protocol'. Together they form a unique fingerprint.

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 (pp. 671-675). [1593122] (2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006; Vol. 2). 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. 2006. p. 671-675 1593122 (2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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., 1593122, 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006, vol. 2, 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

@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",

month = oct,

day = "3",

doi = "10.1109/CCNC.2006.1593122",

language = "English (US)",

isbn = "1424400856",

series = "2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006",

pages = "671--675",

booktitle = "2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006",

note = "2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006 ; Conference date: 08-01-2006 Through 10-01-2006",

}

TY - GEN

T1 - On providing confidentiality in link state routing protocol

AU - Huang, Dijiang

AU - Sinha, Amit

AU - Medhi, Deep

PY - 2006/10/3

Y1 - 2006/10/3

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

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

SP - 671

EP - 675

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

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

Y2 - 8 January 2006 through 10 January 2006

ER -