International Association for Cryptologic Research
In this paper the authors provide the provable-security treatment of path vector routing protocols. They first design a security definition for routing path vector protocols by studying, generalizing, and formalizing numerous known threats. Their model incorporates three major security goals. It is quite strong, yet simple to use. They prove by reduction that S-BGP satisfies two out of the security model's three goals, assuming the underlying signature scheme is secure. Under the same assumption, they next show how the protocol can be modified to meet all three security goals simultaneously.