Authenticated Adversarial Routing
In this paper the authors design a routing protocol for an unreliable and dynamically changing synchronous network that is resilient against malicious insiders who may try to destroy and alter messages or disrupt communication in any way. They model the network as a communication graph G = (V, E) where each vertex/node is a processor and each edge is a communication link. They do not assume that the topology of this graph is fixed or known by the nodes. Rather, they assume a complete graph on n vertices, where some of the edges are \"Up\" and some are \"Down\", and the status of each edge can change dynamically at any time.