Lower bound for scalable Byzantine Agreement

Distributed Computing

Volumn 21, Issue 4, 2008, Pages 239-248

  Holtby, Dan ^a   Kapron, Bruce M ^b   King, Valerie ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Byzantine Agreement; Lower bounds; Malicious adversary; Scalable distributed protocol

Indexed keywords

BYZANTINE AGREEMENT; LOWER BOUNDS; MALICIOUS ADVERSARY; SCALABLE DISTRIBUTED PROTOCOL;

COMPUTER NETWORKS;

EID: 51649126675     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0069-x     Document Type: Article

References (15)

1. 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
2. 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
3. Cloudmark website. http://cloudmark.com/
4. 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
5. 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)
6. Feldman P., Micali S.: An optimal probabilistic protocol for synchronous Byzantine Agreement. SIAM J. Comput. 26(4), 873-933 (1997) doi: 10.1137/S0097539790187084
7. 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
8. 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
9. Gnutella website. http://www.gnutella.com/
10. 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
11. 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)
12. 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
13. Lewis, C., Saia, J.: Scalable Byzantine Agreement. Tech. rep., University of New Mexico (2004). http://www.cs.unm.edu/~saia/papers/sba.pdf
14. 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
15. * 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)