skip to main content
10.1145/1146381.1146424acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Lower bound for scalable Byzantine Agreement

Published: 23 July 2006 Publication History

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 uncorrupted 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 a computation to be the number of uncorrupted processors whose output does not agree with the output of the majority of uncorrupted processors. We show that if there are t corrupted processors, then any protocol which has probability at least 1/2 +1/log n of loss less than t 2/3<over>32fn1/3log5/3n requires at least f rounds.

References

[1]
Ziv Bar-Joseph and Michael Ben-Or. A tight lower bound for randomized synchronous consensus. In PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pages 193--199, New York, NY, USA, 1998. ACM Press.
[2]
Cynthia Dwork, David Peleg, Nicholas Pippenger, and Eli Upfal. Fault tolerance in networks of bounded degree. SIAM J. Comput., 17(5):975--988, 1988.
[3]
Uriel Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE Foundations of Computer Science(FOCS), 1999.
[4]
Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput., 26(4):873--933, 1997.
[5]
Faith E. Fich and Eric Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3):121--163, 2003.
[6]
Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett., 14(4):183--186, 1982.
[7]
Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 990--999, New York, NY, USA, 2006. ACM Press.
[8]
C.S. Lewis and J. Saia. Scalable Byzantine agreement. Technical report, University of New Mexico, 2004.
[9]
A. Russell, M. Saks, and D. Zuckerman. Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proceedings of the Symposium on the Theory of Computing (STOC), 1999.
[10]
A. Russell and D. Zuckerman. Perfect information leader election in log*n + o(1) rounds. In Proceedings of 39th Annual Symposium on Foundations of Computer Science(FOCS), 1998.

Cited By

View all
  • (2009)Distributed Public-Key Cryptography from Weak SecretsProceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '0910.1007/978-3-642-00468-1_9(139-159)Online publication date: 12-Mar-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
July 2006
230 pages
ISBN:1595933840
DOI:10.1145/1146381
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2006

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Byzantine Agreement
  2. distributed computing
  3. lower bounds
  4. malicious adversary
  5. non-adaptive adversary
  6. probabilistic
  7. randomized
  8. scalable

Qualifiers

  • Article

Conference

PODC06

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2009)Distributed Public-Key Cryptography from Weak SecretsProceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '0910.1007/978-3-642-00468-1_9(139-159)Online publication date: 12-Mar-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media