[Resource Topic] 2006/087: Analysis of the SPV Secure Routing Protocol: Weaknesses and Lessons

Welcome to the resource topic for 2006/087

Analysis of the SPV Secure Routing Protocol: Weaknesses and Lessons

Authors: Barath Raghavan, Saurabh Panjwani, Anton Mityagin


We analyze a secure routing protocol, Secure Path Vector (SPV),
proposed in SIGCOMM 2004. SPV aims to provide authenticity
for route announcements in the Border Gateway Protocol (BGP)
using an efficient alternative to ordinary digital signatures, called
constant-time signatures. Today, SPV is often considered the best
cryptographic defense for BGP.

We find subtle flaws in the design of SPV which lead to attacks
that can be mounted by 60% of Autonomous Systems in the Internet.
In addition, we study several of SPV’s design decisions and
assumptions and highlight the requirements for security of routing
protocols. In light of our analysis, we reexamine the need for
constant-time signatures and find that certain standard digital signature schemes can provide the same level of efficiency for route

ePrint: https://eprint.iacr.org/2006/087

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .