Highly Secure and Efficient Routing


Ioannis Avramopoulos, Hisashi Kobayashi, Randolph Wang, Arvind Krishnamurthy. Highly Secure and Efficient Routing. Proc. INFOCOM 2004. March 2004.

In this paper, we consider the problem of routing in an adversarial environment, where a sophisticated adversary has penetrated arbitrary parts of the routing infrastructure and attempts to disrupt routing. We present protocols that are able to route packets as long as at least one non-faulty path exists between the source and the destination. These protocols have low communication overhead, low processing requirements, low incremental cost, and fast fault detection. We also present extensions to the protocols that penalize adversarial routers by blocking their traffic.


pdf


(We found that the protocol described therein has a vulnerability. Please see this amendment.)



© 2004 Randy Wang    (rywang.public@gmail.com)