ABSTRACT
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 corrupt processor may send an unlimited number of messages. The adversary is constrained to choose its corrupt processors at the start, without knowledge of the processors' private random bits, but is otherwise adaptive. To the authors' best knowledge, there have been no subexponential protocols in the asynchronous version of this model and no protocols that compute Byzantine agreement without all-to-all communication in this model even a model in which private channels or cryptography are assumed, unless corrupt processors' messages are limited. We announce a polylogarithmic time protocol in the asynchronous model which appeared in SODA 08 and was recently improved to a resilience of n/(3 + ε). We also give a polylogarithmic time protocol for Byzantine agreement using only Õ(n3/2) total bits of pairwise communication which succeeds with high probability. These results rest on our solution to the problem of selecting a small representative sample of processors (universe reduction). This work extends the authors' work on scalable almost everywhere agreement to everywhere agreement and is an unpublished manuscript.
- Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, and Alexander Shraer. Brahms: byzantine resilient random membership sampling. In PODC, pages 145--154, 2008. Google ScholarDigital Library
- Uriel Feige. Noncryptographic selection protocols. In FOCS, pages 142--153, 1999. Google ScholarDigital Library
- Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, and Dariusz R. Kowalski. On the complexity of asynchronous gossip. In PODC, pages 135--144, 2008. Google ScholarDigital Library
- Ronen Gradwohl, Salil P. Vadhan, and David Zuckerman. Random selection with an adversarial majority. In CRYPTO, pages 409--426, 2006. Google ScholarDigital Library
- Dan Holtby, Bruce M. Kapron, and Valerie King. Lower bound for scalable byzantine agreement. Distributed Computing, 21(4):239--248, 2008.Google ScholarDigital Library
- Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, and Vishal Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. In SODA, pages 1038--1047, 2008. Google ScholarDigital Library
- Valerie King and Jared Saia. Unpublished manuscript.Google Scholar
- Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In SODA, pages 990--999, 2006. Google ScholarDigital Library
- Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Towards secure and scalable computation in peer-to-peer networks. In FOCS, pages 87--98, 2006. Google ScholarDigital Library
- Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: speculative byzantine fault tolerance. SIGOPS Oper. Syst. Rev., 41(6):45--58, 2007. Google ScholarDigital Library
Index Terms
- Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary
Recommendations
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingIn this paper, we consider two fundamental problems in secure distributed computing, namely Asynchronous Byzantine Agreement (ABA) and Asynchronous Secure Multi-party Computation (ASMPC). Our focus is on the honest majority setting, involving a set of n ...
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingFair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates ...
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computingIn a paper appearing in STOC 2013, we considered Byzantine agreement in the classic asynchronous message-passing model. The adversary is adaptive: it can determine which processors to corrupt and what strategy these processors should use as the ...
Comments