{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:39:10Z","timestamp":1770917950527,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":6,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2237814"],"award-info":[{"award-number":["2237814"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623191","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"519-533","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7497-7592","authenticated-orcid":false,"given":"Erica","family":"Blum","sequence":"first","affiliation":[{"name":"Reed College, Portland, OR, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6084-9303","authenticated-orcid":false,"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-3810","authenticated-orcid":false,"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"CISPA Helmoltz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5675-263X","authenticated-orcid":false,"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2568-5628","authenticated-orcid":false,"given":"Simon","family":"Ochsenreither","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_4_1","volume-title":"The next 700 BFT protocols. ACM Trans. Comput. Syst., 32(4)","author":"Aublin P.-L.","year":"2015","unstructured":"P.-L. Aublin, R. Guerraoui, V. Qu\u00e9ma, and M. Vukoli\u0107. The next 700 BFT protocols. ACM Trans. Comput. Syst., 32(4), 2015."},{"key":"e_1_3_2_1_5_1","first-page":"183","volume-title":"13th ACM PODC","author":"Ben-Or M.","year":"1994","unstructured":"M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computations with optimal resilience. In J. Anderson and S. Toueg, editors, 13th ACM PODC, pages 183--192, Los Angeles, CA, USA, Aug. 14-17, 1994. ACM."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92075-3_19"},{"key":"e_1_3_2_1_7_1","unstructured":"E. Buchman. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis University of Guelph Ontario Canada 2016"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538430"},{"key":"e_1_3_2_1_10_1","first-page":"173","volume-title":"Proc. Operating Systems Design and Implementation (OSDI)","author":"Castro M.","year":"1999","unstructured":"M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. Operating Systems Design and Implementation (OSDI), pages 173--186. USENIX, 1999."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"e_1_3_2_1_13_1","first-page":"2705","volume-title":"ACM Conf. on Computer and Communications Security","author":"Giridharan N.","year":"2022","unstructured":"N. Giridharan, L. Kokoris-Kogias, A. Sonnino, and A. Spiegelman. Bullshark: DAG BFT protocols made practical. In ACM Conf. on Computer and Communications Security, pages 2705--2718. ACM, 2022. Available at https:\/\/arxiv.org\/abs\/2201.05677."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_16_1","unstructured":"K. Kursawe and V. Shoup. Optimistic asynchronous atomic broadcast. In L. Caires G. F. Italiano L. Monteiro C. Palamidessi and M. Yung editors ICALP 2005 volume 3580 of LNCS pages 204--215 Lisbon Portugal July 11--15 2005. Springer."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559346"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_22_1","first-page":"88","volume-title":"OPODIS","author":"Ramasamy H. V.","year":"2005","unstructured":"H. V. Ramasamy and C. Cachin. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In OPODIS, pages 88--102, 2005."},{"key":"e_1_3_2_1_23_1","volume-title":"Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys (CSUR), 22(4):299--319","author":"Schneider F. B.","year":"1990","unstructured":"F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys (CSUR), 22(4):299--319, 1990."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623191","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:42:14Z","timestamp":1755740534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":24,"alternative-id":["10.1145\/3576915.3623191","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623191","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}