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

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 420-429

  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; Secretsharing

Indexed keywords

BYZANTINE AGREEMENT; CONSENSUS; DISTRIBUTED COMPUTING; MONTE CARLO ALGORITHMS; PEER TO PEER; SAMPLERS; SECRETSHARING;

DISTRIBUTED COMPUTER SYSTEMS; MONTE CARLO METHODS;

ALGORITHMS;

EID: 77956253063     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835798     Document Type: Conference Paper

References (27)

1. Ittai Abraham, Danny Dolev, Rica Gonen, and Joe Halper. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Principles of Distributed Computing(PODC), 2006.
2. Ittai Abraham, Danny Dolev, and Joe Halper. Lower bounds on implementing robust and resilient mediators. In IACR Theory of Cryptography Conference(TCC), 2008.
3. A. Agbaria and R. Friedman. Overcoming Byzantine Failures Using Checkpointing. University of Illinois at Urbana-Champaign Coordinated Science Laboratory technical report no. UILU-ENG-03-2228 (CRHC-03-14), 2003.
4. Y. Amir, C. Danilov, D. Dolev, J. Kirsch, J. Lane, C. Nita-Rotaru, J. Olsen, and D. Zage. Scaling Byzantine fault-tolerant replication to wide area networks. In Proc. Int. Conf. on Dependable Systems and Networks, pages 105-114. Citeseer, 2006.
5. DP Anderson and J. Kubiatowicz. The worldwide computer. Scientific American, 286(3):28-35, 2002.
6. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS), 20(4):398-461, 2002.
7. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, and Roman Smolensky. The bit extraction problem of t-resilient functions (preliminary version). In FOCS, pages 396-407. IEEE, 1985.
8. A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, 2009.
9. Allen Clement, Mirco Marchetti, Edmund Wong, Lorenzo Alvisi, and Mike Dahlin. Byzantine fault tolerance: the time is now. In LADIS'08: Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, pages 1-4, New York, NY, USA, 2008. ACM.
10. J. Cowling, D. Myers, B. Liskov, R. Rodrigues and L. Shrira. Hq replication: A hybrid quorum protocol for Byzantine fault tolerance. In In Proceedings of Operating Systems Design and Implementation (OSDI), San Diego, CA, USA, 2005.
11. Danny Dolev and R̈udiger Reischuk. Bounds on information exchange for Byzantine agreement. J. ACM, 32(1):191-204, 1985.
12. Uriel Feige. Noncryptographic selection protocols. In Proceedings of 40th IEEE Foundations of Computer Science(FOCS), 1999.
13. Juan A. Garay and Rafail Ostrovsky. Almost-everywhere secure computation. In EUROCRYPT, pages 307-323, 2008.
14. Dan Holtby, Bruce M. Kapron, and Valerie King. Lower bound for scalable Byzantine agreement. Distributed Computing, 21(4):239-248, 2008.
15. Svante Janson. On concentration of probability. Combinatorics, Probability and Computing, 11:2002, 1999.
16. Bruce Kapron, David Kempe, Valerie King, Jared Saia, and Vishal Sanwalani. Scalable algorithms for Byzantine agreement and leader election with full information. ACM Transactions on Algorithms(TALG), 2009.
17. Valerie King, Olumuyiwa Oluwasanmi, and Jared Saia. An empirical study of a scalable Byzantine agreement aglrotihm. In 19th International Heterogeneity in Computing Workshop, 2010.
18. 3/2) bits. In International Symposium on Distributed Computing (DISC), 2009.
19. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Scalable leader election. In Proceedings of the Symposium on Discrete Algorithms(SODA), 2006.
20. Valerie King, Jared Saia, Vishal Sanwalani, and Erik Vee. Towards secure and scalable computation in peer-to-peer networks. In Foundations of Computer Science(FOCS), 2006.
21. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: speculative Byzantine fault tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, page 58. ACM, 2007.
22. Dahlia Malkhi and Michael Reiter. Unreliable intrusion detection in distributed computations. In In Computer Security Foundations Workshop, pages 116-124, 1997.
23. R. J. McEliece and D. V. Sarwate. On sharing secrets and reed-solomon codes. Commun. ACM, 24(9):583-584, 1981.
24. M.O. Rabin. Randomized Byzantine generals. In Foundations of Computer Science, 1983., 24th Annual Symposium on, pages 403-409, 1983.
25. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao and J. Kubiatowicz. Pond: the OceanStore prototype. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pages 1-14, 2003.
26. E. Shi, A. Perrig, et al. Designing secure sensor networks. IEEE Wireless Communications, 11(6):38-43, 2004.
27. A. Wright. Contemporary approaches to fault tolerance. Communications of the ACM, 52(7):13-15, 2009.