Practical Robust Communication in DHTs Tolerating a Byzantine Adversary

—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and message sending incur significant communication costs. For example, a simple scheme used in many Byzantine fault-tolerant DHT constructions of n nodes requires O(log3 n) messages; this is likely impractical for real-world applications. The previous best known message complexity is O(log2 n) in expectation; however, the corresponding protocol suffers from prohibitive costs owing to hidden constants in the asymptotic notation and setup costs. In this paper, we focus on reducing the communication costs against a computationally bounded adversary. We employ threshold cryptography and distributed key generation to define two protocols both of which are more efficient than existing solutions. In comparison, our first protocol is deterministic with O(log2 n) message complexity and our second protocol is randomiz...

• Type: Conference
• Year: 2010
• Where: ICDCS
• Authors: Maxwell Young, Aniket Kate, Ian Goldberg, Martin Karsten
• Keywords: Communication Costs, Distributed And Parallel Computing, ICDCS 2010, Message Complexity, Setup Costs