Efficient Security Mechanisms for Routing Protocols
As the economy and critical infrastructure increasingly rely on the Internet, securing routing protocols becomes of critical importance. In this paper, the authors present four new mechanisms as tools for securing distance vector and path vector routing protocols. For securing distance vector protocols, the 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, they present a new mechanism, similar to hash chains, that they call tree-authenticated one-way chains.