{"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":1770917950048,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"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":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538426","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"381-391","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"VMware Research, Herzelia, Israel"}]},{"given":"Naama","family":"Ben-David","sequence":"additional","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}]},{"given":"Sravya","family":"Yandamuri","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_2_1","volume-title":"Distributed Computing","author":"Aguilera Marcos Kawazoe","year":"1998","unstructured":"Marcos Kawazoe Aguilera and Sam Toueg . Correctness proof of ben-or's randomized consensus algorithm . Distributed Computing , 1998 . Marcos Kawazoe Aguilera and Sam Toueg. Correctness proof of ben-or's randomized consensus algorithm. Distributed Computing, 1998."},{"key":"e_1_3_2_2_3_1","first-page":"191","volume-title":"ACM Symposium on Principles of Distributed Computing (PODC)","author":"Ben-David Naama","year":"2021","unstructured":"Naama Ben-David and Kartik Nayak . Brief announcement : Classifying trusted hardware via unidirectional communication . In ACM Symposium on Principles of Distributed Computing (PODC) , pages 191 -- 194 , 2021 . Naama Ben-David and Kartik Nayak. Brief announcement: Classifying trusted hardware via unidirectional communication. In ACM Symposium on Principles of Distributed Computing (PODC), pages 191--194, 2021."},{"key":"e_1_3_2_2_4_1","first-page":"27","volume-title":"ACM Symposium on Principles of Distributed Computing (PODC)","author":"Ben-Or Michael","year":"1983","unstructured":"Michael Ben-Or . Another advantage of free choice (extended abstract) completely asynchronous agreement protocols . In ACM Symposium on Principles of Distributed Computing (PODC) , pages 27 -- 30 , 1983 . Michael Ben-Or. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In ACM Symposium on Principles of Distributed Computing (PODC), pages 27--30, 1983."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_18"},{"key":"e_1_3_2_2_6_1","volume-title":"Information and Computation","author":"Bracha Gabriel","year":"1987","unstructured":"Gabriel Bracha . Asynchronous byzantine agreement protocols . Information and Computation , 1987 . Gabriel Bracha. Asynchronous byzantine agreement protocols. Information and Computation, 1987."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_8_1","first-page":"123","volume-title":"in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC","author":"Cachin Christian","year":"2000","unstructured":"Christian Cachin , Klaus Kursawe , and Victor Shoup . Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography . In in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC , pages 123 -- 132 , 2000 . Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. In in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC, pages 123--132, 2000."},{"key":"e_1_3_2_2_9_1","volume-title":"From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint arXiv:2005.08795","author":"Cachin Christian","year":"2020","unstructured":"Christian Cachin and Luca Zanolini . From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint arXiv:2005.08795 , 2020 . Christian Cachin and Luca Zanolini. From symmetric to asymmetric asynchronous byzantine consensus. arXiv preprint arXiv:2005.08795, 2020."},{"key":"e_1_3_2_2_10_1","volume-title":"International Symposium on Distributed Computing (DISC)","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen , Idit Keidar , and Alexander Spiegelman . Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp . In International Symposium on Distributed Computing (DISC) , 2020 . Shir Cohen, Idit Keidar, and Alexander Spiegelman. Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. In International Symposium on Distributed Computing (DISC), 2020."},{"key":"e_1_3_2_2_11_1","volume-title":"Two more algorithms for randomized signature-free asynchronous binary byzantine consensus with t < n\/3 and o(n2) messages and o(1) round expected termination. arXiv preprint arXiv:2002.08765","author":"Crain Tyler","year":"2020","unstructured":"Tyler Crain . Two more algorithms for randomized signature-free asynchronous binary byzantine consensus with t < n\/3 and o(n2) messages and o(1) round expected termination. arXiv preprint arXiv:2002.08765 , 2020 . Tyler Crain. Two more algorithms for randomized signature-free asynchronous binary byzantine consensus with t < n\/3 and o(n2) messages and o(1) round expected termination. arXiv preprint arXiv:2002.08765, 2020."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00087"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467907"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993832"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_24"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0075-3"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611468"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538426","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":29,"alternative-id":["10.1145\/3519270.3538426","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538426","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}