Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary

Journal of the ACM

Volumn 58, Issue 4, 2011, Pages

  King, Valerie ^a   Saia, Jared ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b University of New Mexico   (United States)

Author keywords

Byzantine agreement; Consensus; Distributed computing; Monte carlo algorithms; Peer to peer; Samplers; Secret sharing

Indexed keywords

BYZANTINE AGREEMENT; CONSENSUS; MONTE CARLO ALGORITHMS; PEER TO PEER; SAMPLERS; SECRET-SHARING;

DISTRIBUTED COMPUTER SYSTEMS;

ALGORITHMS;

EID: 79960819698     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1989727.1989732     Document Type: Conference Paper

References (29)

1. ABRAHAM, I., DOLEV, D., GONEN, R., AND HALPER, J. 2006. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the Symposium on Principles of Distributed Computing (PODC).
2. ABRAHAM, I., DOLEV, D., AND HALPER, J. 2008. Lower bounds on implementing robust and resilient mediators. In Proceedings of the IACR Theory of Cryptography Conference (TCC).
3. AGBARIA, A. AND FRIEDMAN, R. 2003. Overcoming Byzantine Failures Using Checkpointing. Coordinated Science Laboratory, Tech. rep. no. UILU-ENG-03-2228 (CRHC-03-14), University of Illinois at Urbana-Champaign.
4. AMIR, Y., DANILOV, C., DOLEV, D., KIRSCH, J., LANE, J., NITA-ROTARU, C., OLSEN, J., AND ZAGE, D. 2006. Scaling Byzantine fault-tolerant replication to wide area networks. In Proceedings of the International Conference on Dependable Systems and Networks. 105-114. (Pubitemid 44930412)
5. ANDERSON, D. AND KUBIATOWICZ, J. 2002. The worldwide computer. Scientif. Amer. 286, 3, 28-35.
6. CASTRO, M. AND LISKOV, B. 2002. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4, 398-461. (Pubitemid 135702591)
7. CHENG, C.-F., WANG, S.-C., AND LIANG, T. 2009. The anatomy study of server-initial agreement for general hierarchy wired/wireless networks. Comput. Stand. Interfaces 31, 1, 219-226.
8. CHOR, B., GOLDREICH, O., HÅSTAD, J., FRIEDMAN, J., RUDICH, S., AND SMOLENSKY, R. 1985. The bit extraction problem of t-resilient functions (preliminary version). In Proceedings of the Conference on Foundations in Computer Science (FOCS). IEEE, 396-407.
9. CLEMENT, A., MARCHETTI, M., WONG, E., ALVISI, L., AND DAHLIN, M. 2008. Byzantine fault tolerance: the time is now. In Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware (LADIS'08). ACM, New York, 1-4.
10. CLEMENT, A.,WONG, E., ALVISI, L., DAHLIN, M., AND MARCHETTI, M. 2009. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of 21st ACM SIGOPS Symposium on Operating Systems Principles.
11. COWLING, J., MYERS, D., LISKOV, B., RODRIGUES, R., AND SHRIRA, L. 2005. Hq replication: A hybrid quorum protocol for byzantine fault tolerance. In Proceedings of Operating Systems Design and Implementation (OSDI).
12. DOLEV, D. AND REISCHUK, R. 1985. Bounds on information exchange for Byzantine agreement. J. ACM 32, 1, 191-204. (Pubitemid 15599045)
13. FEIGE, U. 1999. Noncryptographic selection protocols. In Proceedings of 40th IEEE Foundations of Computer Science (FOCS).
14. GARAY, J. A. AND OSTROVSKY, R. 2008. Almost-everywhere secure computation. In Proceedings of EUROCRYPT. 307-323. (Pubitemid 351766682)
15. HOLTBY, D., KAPRON, B. M., AND KING, V. 2008. Lower bound for scalable byzantine agreement. Distrib. Comput. 21, 4, 239-248.
16. JANSON, S. 1999. On concentration of probability. Combinat. Probabil. Comput. 11, 2002.
17. KAPRON, B.,KEMPE, D.,KING, V., SAIA, J., AND SANWALANI, V. 2009. Scalable algorithms for byzantine agreement and leader election with full information. ACM Trans. Algor. (TALG).
18. KING, V.,OLUWASANMI, O., AND SAIA, J. 2010. An empirical study of a scalable byzantine agreement aglrotihm. In Proceedings of the 19th International Heterogeneity in Computing Workshop.
19. KING, V. AND SAIA, J. 2009. From almost-everywhere to everywhere: Byzantine agreement in Q(n3/2) bits. In Proceedings of the International Symposium on Distributed Computing (DISC).
20. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006a. Scalable leader election. In Proceedings of the Symposium on Discrete Algorithms (SODA).
21. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006b. Towards secure and scalable computation in peer-to-peer networks. In Proceedings of the Foundations of Computer Science (FOCS).
22. KOTLA, R., ALVISI, L., DAHLIN, M., CLEMENT, A., AND WONG, E. 2007. Zyzzyva: speculative byzantine fault tolerance. In Proceedings of the 24th ACM SIGOPS Symposium on Operating Systems Principles. ACM, 58.
23. MALKHI, D. AND REITER, M. 1997. Unreliable intrusion detection in distributed computations. In Proceedings of the Computer Security Foundations Workshop. 116-124.
24. MCELIECE, R. J. AND SARWATE, D. V. 1981. On sharing secrets and reed-solomon codes. Comm. ACM 24, 9, 583-584.
25. RABIN, M. 1983. Randomized byzantine generals. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science. 403-409.
26. RHEA, S., EATON, P., GEELS, D., WEATHERSPOON, H., ZHAO, B., AND KUBIATOWICZ, J. 2003. Pond: the OceanStore prototype. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies. 1-14.
27. SHI, E. AND PERRIG, A. 2004. Designing secure sensor networks. IEEE Wirel. Comm. 11, 6, 38-43. (Pubitemid 40021188)
28. WRIGHT, A. 2009. Contemporary approaches to fault tolerance. Comm. ACM 52, 7, 13-15.
29. YOSHINO, H.,HAYASHIBARA, N.,ENOKIDO, T., AND TAKIZAWA,M. 2005. Byzantine agreement protocol using hierarchical groups. In Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS'05). IEEE Computer Society Press, 64-70. (Pubitemid 41190307)