Making Chord Robust to Byzantine Attacks

Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are no more than (1/4 − ǫ)z insertion events for Byzantine peers for a fixed ǫ > 0; and 3) the number of insertion and deletion events for correct peers is no more than zk for some tunable parameter k. We assume there is an computationally unbounded adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enfor...

• Type: Conference
• Year: 2005
• Where: ESA
• Authors: Amos Fiat, Jared Saia, Maxwell Young
• Keywords: Byzantine Peers, Distributed Hash Table, ESA 2005, Total Peers