Group Spreading: A Protocol for Provably Secure Distributed Name Service

In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must be implemented on top of this collection of peers that translates given names into IP addresses, by implementing a dynamic distributed database for concurrent IP lookups. This paper shows that this very fundamental task can be implemented in a completely decentralized way in the presence of arbitrary massive Byzantine attacks while expending only poly-logarithmic overhead for retrieval, protection, and maintenance. To accomplish this, this paper introduces a new methodology that essentially maintains a random distribution of all (honest and Byzantine) peers in an overlay network for any sequence of arrivals and departures of nodes up to a certain rate, under a reasonable assumption that Byzantine peers are a significant minority. Keeping nodes randomly distributed allows the system to form reliable quorums fo...

• Type: Conference
• Year: 2004
• Where: ICALP
• Authors: Baruch Awerbuch, Christian Scheideler
• Keywords: Concurrent Ip Lookups, Dynamic Distributed Database, ICALP 2004, Massive Byzantine Attacks, Theoretical Computer Science