{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:25Z","timestamp":1750307485306,"version":"3.41.0"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T00:00:00Z","timestamp":1283472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2010,9,3]]},"DOI":"10.1145\/1855118.1855136","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:53:08Z","timestamp":1284475988000},"page":"89-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Scalable byzantine computation"],"prefix":"10.1145","volume":"41","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[{"name":"University of Victoria, Victoria, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095817"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146393"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802638"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060291"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1130992"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777785"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/872016.872155"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278304"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.02.003"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411510"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9099-9"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1002\/0470867167","volume-title":"Grid computing: making the global infrastructure a reality","author":"Berman F.","year":"2003","unstructured":"F. Berman , G. Fox , and A. Hey . Grid computing: making the global infrastructure a reality . John Wiley & Sons Inc , 2003 . F. Berman, G. Fox, and A. Hey. Grid computing: making the global infrastructure a reality. John Wiley & Sons Inc, 2003."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073841"},{"key":"e_1_2_1_15_1","volume-title":"UIUC","author":"Bhandari V.","year":"2005","unstructured":"V. Bhandari and N. H. Vaidya . On reliable broadcast in a radio network: A simplified characterization. Technical report, CSL , UIUC , May 2005 . V. Bhandari and N. H. Vaidya. On reliable broadcast in a radio network: A simplified characterization. Technical report, CSL, UIUC, May 2005."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146420"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.03.008"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806743"},{"key":"e_1_2_1_19_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"33","author":"Castro M.","year":"1998","unstructured":"M. Castro and B. Liskov . Practical Byzantine fault tolerance . Operating Systems Review , 33 : 173 -- 186 , 1998 . M. Castro and B. Liskov. Practical Byzantine fault tolerance. Operating Systems Review, 33:173--186, 1998.","journal-title":"Operating Systems Review"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2007.12.004"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294280"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529974.1529992"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles","author":"Clement A.","year":"2009","unstructured":"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 . 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."},{"key":"e_1_2_1_25_1","volume-title":"In Proceedings of Operating Systems Design and Implementation (OSDI)","author":"Cowling J.","year":"2005","unstructured":"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 . 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."},{"key":"e_1_2_1_26_1","first-page":"190","volume-title":"Proceedings of the 7th symposium on Operating systems design and implementation","author":"Cowling J.","unstructured":"J. Cowling , D. Myers , B. Liskov , R. Rodrigues , and L. Shrira . HQ replication: A hybrid quorum protocol for Byzantine fault tolerance . In Proceedings of the 7th symposium on Operating systems design and implementation , page 190 . USENIX Association, 2006. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the 7th symposium on Operating systems design and implementation, page 190. USENIX Association, 2006."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1060"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.42"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12169"},{"key":"e_1_2_1_31_1","unstructured":"Farsite. The Farsite Project. http:\/\/research.microsoft.com\/farsite.  Farsite. The Farsite Project. http:\/\/research.microsoft.com\/farsite."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796481"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.14"},{"key":"e_1_2_1_34_1","first-page":"127","volume-title":"Fundamentals of Computation Theory","author":"Fischer M.","year":"1983","unstructured":"M. Fischer . The consensus problem in unreliable distributed systems (a brief survey) . In Fundamentals of Computation Theory , pages 127 -- 140 , 1983 . M. Fischer. The consensus problem in unreliable distributed systems (a brief survey). In Fundamentals of Computation Theory, pages 127--140, 1983."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_36_1","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"28","volume-title":"Towards the Learning Grid","author":"Foster I. T.","year":"2005","unstructured":"I. T. Foster , N. R. Jennings , and C. Kesselman . Brain meets brawn: Why grid and agents need each other . In P. Ritrovato, S. A. Cerri, S. Salerno, M. Gaeta, C. Allison, and T. Dimitrakos, editors, Towards the Learning Grid , volume 127 of Frontiers in Artificial Intelligence and Applications , pages 28 -- 40 . IOS Press , 2005 . I. T. Foster, N. R. Jennings, and C. Kesselman. Brain meets brawn: Why grid and agents need each other. In P. Ritrovato, S. A. Cerri, S. Salerno, M. Gaeta, C. Allison, and T. Dimitrakos, editors, Towards the Learning Grid, volume 127 of Frontiers in Artificial Intelligence and Applications, pages 28--40. IOS Press, 2005."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_10"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_25"},{"key":"e_1_2_1_39_1","volume-title":"Security Implications of Typical Grid Computing Usage Scenarios","author":"Humphrey M.","year":"2000","unstructured":"M. Humphrey and M. Thompson . Security Implications of Typical Grid Computing Usage Scenarios , 2000 . Security Working Group GRIP for um draft. M. Humphrey and M. Thompson. Security Implications of Typical Grid Computing Usage Scenarios, 2000. Security Working Group GRIP forum draft."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_42"},{"key":"e_1_2_1_41_1","first-page":"1038","volume-title":"SODA","author":"Kapron B. M.","year":"2008","unstructured":"B. M. Kapron , D. Kempe , V. King , J. Saia , and V. Sanwalani . Fast asynchronous byzantine agreement and leader election with full information . In SODA , pages 1038 -- 1047 , 2008 . B. M. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. In SODA, pages 1038--1047, 2008."},{"key":"e_1_2_1_42_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Kearns M. J.","year":"2003","unstructured":"M. J. Kearns and L. E. Ortiz . Algorithms for interdependent security games . In Advances in Neural Information Processing Systems (NIPS) , 2003 . M. J. Kearns and L. E. Ortiz. Algorithms for interdependent security games. In Advances in Neural Information Processing Systems (NIPS), 2003."},{"key":"e_1_2_1_43_1","volume-title":"Load balanced scalable byzantine agreement through quorum building, with full information. In submitted to ICDCN","author":"King V.","year":"2011","unstructured":"V. King , S. Lonergan , J. Saia , and A. Trehan . Load balanced scalable byzantine agreement through quorum building, with full information. In submitted to ICDCN , 2011 . V. King, S. Lonergan, J. Saia, and A. Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. In submitted to ICDCN, 2011."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400784"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813223"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835798"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109667"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.77"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374437"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_54_1","first-page":"204","volume-title":"Proceedings of the 7th symposium on Operating systems design and implementation","author":"Li H.","unstructured":"H. Li , A. Clement , E. Wong , J. Napper , I. Roy , L. Alvisi , and M. Dahlin . BAR gossip . In Proceedings of the 7th symposium on Operating systems design and implementation , page 204 . USENIX Association, 2006. H. Li, A. Clement, E.Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR gossip. In Proceedings of the 7th symposium on Operating systems design and implementation, page 204. USENIX Association, 2006."},{"key":"e_1_2_1_55_1","volume-title":"Workshop on Hot Topics in System Dependability. Citeseer","author":"Mao Y.","year":"2009","unstructured":"Y. Mao , F. Junqueira , and K. Marzullo . Towards low latency state machine replication for uncivil wide-area networks . In Workshop on Hot Topics in System Dependability. Citeseer , 2009 . Y. Mao, F. Junqueira, and K. Marzullo. Towards low latency state machine replication for uncivil wide-area networks. In Workshop on Hot Topics in System Dependability. Citeseer, 2009."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0082-4"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_14"},{"volume-title":"Algorithmic Game Theory","year":"2007","key":"e_1_2_1_58_1","unstructured":"Nisan, Roughgarden, Tardos, and Vazirani. Algorithmic Game Theory . Cambridge University Press , 2007 . Nisan, Roughgarden, Tardos, and Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007."},{"key":"e_1_2_1_59_1","unstructured":"Oceanstore. The Oceanstore Project. http:\/\/oceanstore.cs.berkeley.edu.  Oceanstore. The Oceanstore Project. http:\/\/oceanstore.cs.berkeley.edu."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835756"},{"key":"e_1_2_1_61_1","first-page":"1","volume-title":"Proceedings of the 2nd USENIX Conference on File and Storage Technologies","author":"Rhea S.","year":"2003","unstructured":"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 . 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."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1368895"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135437"},{"key":"e_1_2_1_66_1","volume-title":"Workshop on Economics of Peer-to-Peer Systems","author":"Vishnumurthy V.","year":"2003","unstructured":"V. Vishnumurthy , S. Chandrakumar , and E. Sirer . Karma: A secure economic framework for peer-topeer resource sharing . In Workshop on Economics of Peer-to-Peer Systems , 2003 . V. Vishnumurthy, S. Chandrakumar, and E. Sirer. Karma: A secure economic framework for peer-topeer resource sharing. In Workshop on Economics of Peer-to-Peer Systems, 2003."},{"key":"e_1_2_1_67_1","unstructured":"Wikipedia. Anonymous Peer-to-peer. http:\/\/en.wikipedia.org\/wiki\/AnonymousP2P.  Wikipedia. Anonymous Peer-to-peer. http:\/\/en.wikipedia.org\/wiki\/AnonymousP2P."},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of Information Survivability Workshop (ISW)","author":"Yan J.","year":"2000","unstructured":"J. Yan , S. Early , and R. Anderson . The xenoservice-a distributed defeat for distributed denial of service . Proceedings of Information Survivability Workshop (ISW) , 2000 . J. Yan, S. Early, and R. Anderson. The xenoservice-a distributed defeat for distributed denial of service. Proceedings of Information Survivability Workshop (ISW), 2000."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1855118.1855136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1855118.1855136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:09:10Z","timestamp":1750248550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1855118.1855136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,3]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9,3]]}},"alternative-id":["10.1145\/1855118.1855136"],"URL":"https:\/\/doi.org\/10.1145\/1855118.1855136","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2010,9,3]]},"assertion":[{"value":"2010-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}