Authenticated Adversarial Routing

: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majority of malicious insiders try to destroy and alter messages or disrupt communication in any way. More specically, in this paper we seek to answer the following question: Given a network in which the majority of nodes are controlled by a node-controlling adversary and whose topology is changing every round, is it possible to develop a protocol with polynomially-bounded memory per processor that guarantees throughput-ecient and correct end-to-end communication? We answer the question armatively for extremely general corruption patterns: we only request that the topology of the network and the corruption pattern of the adversary leaves at least one path each round connecting the sender and receiver through honest nodes (though this path may change at every round). Out construction works in the public-key settin...

• Type: Conference
• Year: 2009
• Where: TCC
• Authors: Yair Amir, Paul Bunn, Rafail Ostrovsky
• Keywords: Cryptography, Honest Nodes, Nodes Making Decisions, TCC 2009, Worst Possible Graph