• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Efficient Security Mechanisms for Routing Protocols (2003)

Cached

  • Download as a PDF

Download Links

  • [www.ece.cmu.edu]
  • [sparrow.ece.cmu.edu]
  • [sparrow.ece.cmu.edu]
  • [www.isoc.org]
  • [www.cs.rice.edu]
  • [www.monarch.cs.cmu.edu]
  • [monarch.cs.cmu.edu]
  • [monarch.cs.rice.edu]
  • [www.monarch.cs.rice.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.potaroo.net]
  • [www.monarch.cs.cmu.edu]
  • [monarch.cs.rice.edu]
  • [monarch.cs.cmu.edu]
  • [www.monarch.cs.rice.edu]
  • [www.ece.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yih-chun Hu , Adrian Perrig , David B. Johnson
Venue:In Proc. NDSS’03
Citations:52 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3

Version History

Metadata Version 3

User correction supplied by SystemCorrections

DatumValueSource
TITLE Efficient Security Mechanisms for Routing Protocols user correction - Legacy Corrections
AUTHOR NAME Yih-chun Hu user correction - Legacy Corrections
AUTHOR AFFIL Carnegie Mellon University user correction - Legacy Corrections
AUTHOR NAME Adrian Perrig user correction - Legacy Corrections
AUTHOR NAME David B. Johnson user correction - Legacy Corrections
ABSTRACT As our economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, we present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, our hash tree chain mechanism forces a router to increase the distance (metric) when forwarding a routing table entry. To provide authentication of a received routing update in bounded time, we present a new mechanism, similar to hash chains, that we call tree-authenticated oneway chains. For cases in which the maximum metric is large, we present skiplists, which provides more efficient initial computation cost and more efficient element verification; this mechanism is based on a new cryptographic mechanism, called MW-chains, which we also present. For securing path vector protocols, our cumulative authentication mechanism authenticates the list of routers on the path in a routing update, preventing removal or reordering of the router addresses in the list; the mechanism uses only a single authenticator in the routing update rather than one per router address. We also present a simple mechanism to securely switch one-way chains, by authenticating the next one-way chain using the previous one. These mechanisms are all based on efficient symmetric cryptographic techniques and can be used as building blocks for securing routing protocols. user correction - Legacy Corrections
YEAR 2003 INFERENCE
VENUE In Proc. NDSS’03 INFERENCE
VENUE TYPE CONFERENCE INFERENCE
PAGES 57--73 INFERENCE
CITATIONS 7 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University