An efficient message authentication scheme for link state routing
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We study methods for reducing the cost of secure link state routing. In secure link state routing, routers may need to verify the authenticity of many routing updates, and some routers such as border routers may need to sign many routing updates. Previous work such as public-key based schemes are very expensive computationally or have certain limitations. This paper presents an efficient solution, based on a detection-diagnosis-recovery approach, for the link state routing update authentication problem. Our scheme is scalable to handle large networks, applicable to routing protocols that use multiple-valued cost metrics, and applicable even, when link states change frequently.Keywords
This publication has 18 references indexed in Scilit:
- Digital signature protection of the OSPF routing protocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reducing the cost of security in link-state routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- OSPF Version 2Published by RFC Editor ,1997
- State transition analysis: a rule-based intrusion detection approachIEEE Transactions on Software Engineering, 1995
- Network intrusion detectionIEEE Network, 1994
- Integrating security in inter-domain routing protocolsACM SIGCOMM Computer Communication Review, 1993
- A survey of intrusion detection techniquesComputers & Security, 1993
- The MD5 Message-Digest AlgorithmPublished by RFC Editor ,1992
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978