Abstract
We consider the problem of computing Byzantine Agreement in a synchronous network with n processors, each with a private random string, where each pair of processors is connected by a private communication line. The adversary is malicious and non-adaptive, i.e., it must choose the processors to corrupt at the start of the algorithm. Byzantine Agreement is known to be computable in this model in an expected constant number of rounds. We consider a scalable model where in each round each uncorrupt processor can send to any set of log n other processors and listen to any set of log n processors. We define the loss of an execution to be the number of uncorrupt processors whose output does not agree with the output of the majority of uncorrupt processors. We show that if there are t corrupt processors, then any randomised protocol which has probability at least 1/2 + 1/ logn of loss less than \({\frac{t^{2/3}}{16fn^{1/3}\log^{5/3}{n}}}\) requires at least f rounds. This also shows that lossless protocols require both \({{\tilde\Omega(n^{1/3})}}\) rounds, and for at least one uncorrupt processor to send \({{\tilde\Omega(n^{1/3})}}\) messages during the protocol.
Similar content being viewed by others
References
Bar-Joseph, Z., Ben-Or, M.: A tight lower bound for randomized synchronous consensus. In: PODC ’98: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 193–199. ACM Press, New York (1998). doi:10.1145/277697.277733
Christin, N., Weigend, A.S., Chuang, J.: Content availability, pollution and poisoning in file sharing peer-to-peer networks. In: EC ’05: Proceedings of the 6th ACM Conference on Electronic commerce, pp. 68–77. ACM Press, New York (2005). doi:10.1145/1064009.1064017
Cloudmark website. http://cloudmark.com/
Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: STOC ’86: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 370–379. ACM Press, New York (1986). doi:10.1145/12130.12169
Feige, U.: Noncryptographic selection protocols. In: FOCS ’99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p. 142. IEEE Computer Society, Washington DC (1999)
Feldman P., Micali S.: An optimal probabilistic protocol for synchronous Byzantine Agreement. SIAM J. Comput. 26(4), 873–933 (1997) doi:10.1137/S0097539790187084
Fich F., Ruppert E.: Hundreds of impossibility results for distributed computing. Distrib. Comput. 16(2–3), 121–163 (2003) doi:10.1007/s00446-003-0091-y
Fischer M.J., Lynch N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183–186 (1982) http://citeseer.ist.psu.edu/fischer81lower.html
Gnutella website. http://www.gnutella.com/
King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: SODA ’06: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 990–999. ACM Press, New York (2006). doi:10.1145/1109557.1109667
King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 87–98 (2006)
Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Suri, N., Walter, C.J., Hugue, M.M. (eds.) Advances in Ultra-Dependable Distributed Systems. IEEE Computer Society Press (1995). http://citeseer.ist.psu.edu/lamport82byzantine.html
Lewis, C., Saia, J.: Scalable Byzantine Agreement. Tech. rep., University of New Mexico (2004). http://www.cs.unm.edu/~saia/papers/sba.pdf
Russell, A., Saks, M., Zuckerman, D.: Lower bounds for leader election and collective coin-flipping in the perfect information model, pp. 339–347 (1999). http://citeseer.ist.psu.edu/russell99lower.html
Russell, A., Zuckerman, D.: Perfect information leader election in log * n + o(1) rounds. In: FOCS ’98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p. 576. IEEE Computer Society, Washington, DC (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Holtby, D., Kapron, B.M. & King, V. Lower bound for scalable Byzantine Agreement. Distrib. Comput. 21, 239–248 (2008). https://doi.org/10.1007/s00446-008-0069-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-008-0069-x