We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the adversary is malicious, controls a constant fraction of processors, and can view all messages in a round before sending out its own messages for that round. Furthermore, each bad processor may send an unlimited number of messages. The only constraint on the adversary is that it must choose its corrupt processors at the start, without knowledge of the processors’ private random bits.
A good quorum is a set of O(logn) processors, which contains a majority of good processors. In this paper, we give a synchronous algorithm which uses polylogarithmic time and Õ(vn) bits of communication per processor to bring all processors to agreement on a collection of n good quorums, solving Byzantine agreement as well. The collection is balanced in that no processor is in more than O(logn) quorums. This yields the first solution to Byzantine agreement which is both scalable and load-balanced in the full information model.
The technique which involves going from situation where slightly more than 1/2 fraction of processors are good and and agree on a short string with a constant fraction of random bits to a situation where all good processors agree on n good quorums can be done in a fully asynchronous model as well, providing an approach for extending the Byzantine agreement result to this model.
|Title of host publication||Distributed Computing and Networking|
|Subtitle of host publication||12th International Conference, ICDCN 2011, Bangalore, India, January 2-5, 2011. Proceedings|
|Number of pages||12|
|Publication status||Published - 2011|
|Event||12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India|
Duration: 02 Jan 2011 → 05 Jan 2011
|Name||Lecture Notes in Computer Science|
|Publisher||Springer Berlin Heidelberg|
|Conference||12th International Conference on Distributed Computing and Networking, ICDCN 2011|
|Period||02/01/2011 → 05/01/2011|