Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/lower-bound-for-scalable-byzantine-agreement-4F0X6eX6Vq
References (15)
-
Nicolas Christin, A. Weigend, J. Chuang (2005)
Content availability, pollution and poisoning in file sharing peer-to-peer networks -
U. Feige (1999)
Noncryptographic selection protocols40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
-
A. Russell, David Zuckerman (1998)
Perfect information leader election in log*n+O(1) roundsProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
-
(2001)
Digital Object Identifier (DOI) 10.1007/s00446-003-0091-y Hundreds of impossibility results for distributed computing -
C. Lewis, Jared Saia (2004)
Scalable Byzantine Agreement -
(1995)
Advances in UltraDependable Distributed Systems -
Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee (2006)
Scalable leader election -
Z. Bar-Joseph, M. Ben-Or (1998)
A tight lower bound for randomized synchronous consensus -
M. Fischer, N. Lynch (1982)
A Lower Bound for the Time to Assure Interactive ConsistencyInf. Process. Lett., 14
-
P. Feldman, S. Micali (1997)
An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM J. Comput., 26
-
F. Fich, E. Ruppert (2003)
Hundreds of impossibility results for distributed computingDistrib. Comput., 16
-
Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee (2006)
Towards Secure and Scalable Computation in Peer-to-Peer Networks2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
-
L. Lamport, R. Shostak, M. Pease (1982)
The Byzantine Generals ProblemACM Trans. Program. Lang. Syst., 4
-
C. Dwork, D. Peleg, N. Pippenger, E. Upfal (1986)
Fault tolerance in networks of bounded degreeSIAM J. Comput., 17
-
A. Russell, M. Saks, David Zuckerman (1999)
Lower bounds for leader election and collective coin-flipping in the perfect information model
- Publisher
- Springer Journals
- Copyright
- Copyright © 2008 by Springer-Verlag
- Subject
- Computer Science; Theory of Computation ; Software Engineering/Programming and Operating Systems ; Computer Systems Organization and Communication Networks; Computer Hardware ; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-008-0069-x
- Publisher site
- See Article on Publisher Site
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.
Journal
Distributed Computing – Springer Journals
Published: Aug 5, 2008