Nicolas Braud-Santoni
ABSTRACT
This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity Õ(√n) and time complexity Õ(1).
Our algorithm is based on a novel, unbalanced, almost-everywhere to everywhere Agreement protocol which is interesting in its own right.
- M. Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing (PODC'83), pages 27--30. ACM, 1983. Google Scholar
Digital Library
- B. Bollobas. The isoperimetric number of random regular graphs. European Journal of Combinatorics, pages 241--244, 1988. Google ScholarDigital Library
- M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in o(log n) rounds. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 179--186. ACM, 2006. Google ScholarDigital Library
- B. Chor and C. Dwork. Randomization in byzantine agreement. Advances in COmputing Research 5: Randomness and Computation, pages 443--497, 1989.Google Scholar
- C. Dwork, D. Peleg, N. Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. In Proceedings of the eighteenth annual ACM symposium on Theory of computing (STOC'86), pages 370--379. ACM, 1986. Google ScholarDigital Library
- D. Dolev and R. Reischuk. Bounds on information exchange for byzantine agreement Journal of the ACM, 32(1):191--204, 1985. Google ScholarDigital Library
- M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183--186, 1982.Google ScholarCross Ref
- J. A. Garay and Y. Moses. Fully polynomial byzantine agreement for n> 3t processors in t+ 1 rounds. SIAM J. Comput., 27(1):247--290, 1998. Google ScholarDigital Library
- D. Holtby, B. M. Kapron, and V. King. Lower bound for scalable byzantine agreement. Distributed Computing, 21(4):239--248, 2008.Google ScholarDigital Library
- B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous byzantine agreement and leader election with full information.Google Scholar
- V. King, S. Lonargan, J. Saia, and A. Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. Distributed Computing and Networking, pages 203--214, 2011. Google ScholarCross Ref
- V. King and J. Saia. From almost everywhere to everywhere: Byzantine agreement with õ(n3/2) . Distributed Computing, pages 464--478, 2009. Google ScholarDigital Library
- V. King and J. Saia. Byzantine agreement in polynomial expected time. In 45th Symposium on the Theory of Computing (STOC'13), 2013. Google ScholarDigital Library
- V. King, J. Saia, V. Sanwalani, and E. Vee. Towards secure and scalable computation in peer-to-peer networks. In 47th Annual IEEE Symposium on on the Foundations of Computer Science (FOCS'06), pages 87--98, 2006. Google ScholarDigital Library
- L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, July 1982. Google ScholarDigital Library
- Arpita Patra and C. Pandu Rangan. Brief announcement: communication efficient asynchronous byzantine agreement. In Proceedings of the 29th ACM symposium on Principles of distributed computing (PODC'10), pages 243--244, 2010. Google ScholarDigital Library
- M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228--234, 1980. Google ScholarDigital Library
- M. O. Rabin. Randomized byzantine generals. In 24th Annual Symposium on Foundations of Computer Science (FOCS'83), pages 403--409. IEEE, 1983. Google ScholarDigital Library
- D. Zuckerman. Randomness-optimal oblivious sampling. Random Struct. Algorithms, pages 345--367, 1997. Google ScholarDigital Library
Index Terms
- Fast byzantine agreement
Recommendations
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement
ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and NetworkingThis paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called implicit Byzantine agreement problem where each node starts with ...
Fast byzantine agreement in dynamic networks
PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computingWe study Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). Our main contributions are randomized ...
A self-adjusting algorithm for byzantine agreement
Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we ...
Comments