{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:29:38Z","timestamp":1769297378667,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[],"published-print":{"date-parts":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835798","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"420-429","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Breaking the\n            <i>O<\/i>\n            (\n            <i>n<\/i>\n            <sup>2<\/sup>\n            ) bit barrier"],"prefix":"10.1145","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[{"name":"University of Victoria, Victoria, BC, Canada"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146393"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802638"},{"key":"e_1_3_2_1_3_1","first-page":"03","article-title":"Overcoming Byzantine Failures Using Checkpointing. University of Illinois at Urbana-Champaign Coordinated Science Laboratory technical report no","volume":"03","author":"Agbaria A.","year":"2003","unstructured":"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 . 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.","journal-title":"UILU-ENG-"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.63"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0302-40"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_8_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_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529974.1529992"},{"key":"e_1_3_2_1_10_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_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796481"},{"key":"e_1_3_2_1_13_1","first-page":"307","volume-title":"EUROCRYPT","author":"Juan","year":"2008","unstructured":"Juan A. Garay and Rafail Ostrovsky. Almost-everywhere secure computation . In EUROCRYPT , pages 307 -- 323 , 2008 . Juan A. Garay and Rafail Ostrovsky. Almost-everywhere secure computation. In EUROCRYPT, pages 307--323, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0069-x"},{"key":"e_1_3_2_1_15_1","first-page":"2002","article-title":"On concentration of probability. Combinatorics","volume":"11","author":"Janson Svante","year":"1999","unstructured":"Svante Janson . On concentration of probability. Combinatorics , Probability and Computing , 11 : 2002 , 1999 . Svante Janson. On concentration of probability. Combinatorics, Probability and Computing, 11:2002, 1999.","journal-title":"Probability and Computing"},{"key":"e_1_3_2_1_16_1","volume-title":"ACM Transactions on Algorithms(TALG)","author":"Kapron Bruce","year":"2009","unstructured":"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 . 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."},{"key":"e_1_3_2_1_17_1","volume-title":"19th International Heterogeneity in Computing Workshop","author":"King Valerie","year":"2010","unstructured":"Valerie King , Olumuyiwa Oluwasanmi , and Jared Saia . An empirical study of a scalable byzantine agreement aglrotihm . In 19th International Heterogeneity in Computing Workshop , 2010 . Valerie King, Olumuyiwa Oluwasanmi, and Jared Saia. An empirical study of a scalable byzantine agreement aglrotihm. In 19th International Heterogeneity in Computing Workshop, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813223"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109667"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.77"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/794197.795085"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_25_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_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1368895"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538794"}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","location":"Zurich Switzerland","acronym":"PODC '10","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:24Z","timestamp":1750248504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835798"}},"subtitle":["scalable byzantine agreement with an adaptive adversary"],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":27,"alternative-id":["10.1145\/1835698.1835798","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835798","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}