{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T05:06:53Z","timestamp":1764133613661,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"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":[[2023,1,4]]},"DOI":"10.1145\/3571306.3571333","type":"proceedings-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T16:17:12Z","timestamp":1672762632000},"page":"167-176","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience \u2731"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2428-9537","authenticated-orcid":false,"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[{"name":"International Institute of Information Technology Bangalore, India"}]}],"member":"320","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Dolev and J.\u00a0Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405\u2013414.  I. Abraham D. Dolev and J.\u00a0Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM 405\u2013414.","DOI":"10.1145\/1400751.1400804"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"I. Abraham D. Dolev and G. Stern. 2020. Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. In PODC. ACM 139\u2013148.  I. Abraham D. Dolev and G. Stern. 2020. Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. In PODC. ACM 139\u2013148.","DOI":"10.1145\/3382734.3405722"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. Appan A. Chandramouli and A. Choudhury. 2022. Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. In PODC. ACM 92\u2013102.  A. Appan A. Chandramouli and A. Choudhury. 2022. Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. In PODC. ACM 92\u2013102.","DOI":"10.1145\/3519270.3538417"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388788"},{"volume-title":"ASIACRYPT(LNCS, Vol.\u00a04833)","author":"Hirt Z. Beerliov\u00e1-Trub\u00edniov\u00e1and M.","key":"e_1_3_2_1_6_1","unstructured":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1and M. Hirt . 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC . In ASIACRYPT(LNCS, Vol.\u00a04833) . Springer Verlag , 376\u2013392. Z. Beerliov\u00e1-Trub\u00edniov\u00e1and M. Hirt. 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT(LNCS, Vol.\u00a04833). Springer Verlag, 376\u2013392."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM 27\u201330.  M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM 27\u201330.","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or R. Canetti and O. Goldreich. 1993. Asynchronous Secure Computation. In STOC. ACM 52\u201361.  M. Ben-Or R. Canetti and O. Goldreich. 1993. Asynchronous Secure Computation. In STOC. ACM 52\u201361.","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or S. Goldwasser and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC. ACM 1\u201310.  M. Ben-Or S. Goldwasser and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC. ACM 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or B. Kelmer and T. Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). In PODC. ACM 183\u2013192.  M. Ben-Or B. Kelmer and T. Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). In PODC. ACM 183\u2013192.","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"E. Blum J. Katz and J. Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC(LNCS Vol.\u00a011891). Springer 131\u2013150.  E. Blum J. Katz and J. Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC(LNCS Vol.\u00a011891). Springer 131\u2013150.","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154\u2013162.  G. Bracha. 1984. An Asynchronous [(n-1)\/3]-Resilient Consensus Protocol. In PODC. ACM 154\u2013162.","DOI":"10.1145\/800222.806743"},{"volume-title":"Studies in Secure Multiparty Computation and Applications. Ph.\u00a0D. Dissertation","author":"Canetti R.","key":"e_1_3_2_1_13_1","unstructured":"R. Canetti . 1995. Studies in Secure Multiparty Computation and Applications. Ph.\u00a0D. Dissertation . Weizmann Institute , Israel . R. Canetti. 1995. Studies in Secure Multiparty Computation and Applications. Ph.\u00a0D. Dissertation. Weizmann Institute, Israel."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. 42\u201351.  R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. 42\u201351.","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"B. Chor S. Goldwasser S. Micali and B. Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In FOCS. IEEE 383\u2013395.  B. Chor S. Goldwasser S. Micali and B. Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In FOCS. IEEE 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"volume-title":"INDOCRYPT(LNCS, Vol.\u00a012578)","author":"Choudhury A.","key":"e_1_3_2_1_16_1","unstructured":"A. Choudhury . 2020. Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation . In INDOCRYPT(LNCS, Vol.\u00a012578) . Springer , 810\u2013831. A. Choudhury. 2020. Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation. In INDOCRYPT(LNCS, Vol.\u00a012578). Springer, 810\u2013831."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"A. Choudhury. 2022. Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience. Cryptology ePrint Archive Paper 2022\/917.  A. Choudhury. 2022. Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience. Cryptology ePrint Archive Paper 2022\/917.","DOI":"10.1145\/3571306.3571333"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"A. Choudhury and N. Pappu. 2020. Perfectly-Secure Asynchronous MPC for General Adversaries. In INDOCRYPT(LNCS Vol.\u00a012578). Springer 786\u2013809.  A. Choudhury and N. Pappu. 2020. Perfectly-Secure Asynchronous MPC for General Adversaries. In INDOCRYPT(LNCS Vol.\u00a012578). Springer 786\u2013809.","DOI":"10.1007\/978-3-030-65277-7_35"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_22"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM 148\u2013161.  Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM 148\u2013161.","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_23_1","unstructured":"Matthias Fitzi. 2002. Generalized Communication and Security Models in Byzantine Agreement. Ph.\u00a0D. Dissertation.  Matthias Fitzi. 2002. Generalized Communication and Security Models in Byzantine Agreement. Ph.\u00a0D. Dissertation."},{"volume-title":"DISC(LNCS, Vol.\u00a01499)","author":"Fitzi M.","key":"e_1_3_2_1_24_1","unstructured":"M. Fitzi and U.\u00a0 M. Maurer . 1998. Efficient Byzantine Agreement Secure Against General Adversaries . In DISC(LNCS, Vol.\u00a01499) . Springer , 134\u2013148. M. Fitzi and U.\u00a0M. Maurer. 1998. Efficient Byzantine Agreement Secure Against General Adversaries. In DISC(LNCS, Vol.\u00a01499). Springer, 134\u2013148."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"J.\u00a0A. Garay and A. Kiayias. 2020. SoK: A Consensus Taxonomy in the Blockchain Era. In CT-RSA(LNCS Vol.\u00a012006). Springer 284\u2013318.  J.\u00a0A. Garay and A. Kiayias. 2020. SoK: A Consensus Taxonomy in the Blockchain Era. In CT-RSA(LNCS Vol.\u00a012006). Springer 284\u2013318.","DOI":"10.1007\/978-3-030-40186-3_13"},{"key":"e_1_3_2_1_26_1","unstructured":"Martin Hirt. 2001. Multi-Party Computation: Efficient Protocols General Adversaries and Voting. Ph.\u00a0D. Dissertation. ETH Zurich.  Martin Hirt. 2001. Multi-Party Computation: Efficient Protocols General Adversaries and Voting. Ph.\u00a0D. Dissertation. ETH Zurich."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Martin Hirt and Ueli Maurer. 1997. Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation. In PODC. ACM 25\u201334.  Martin Hirt and Ueli Maurer. 1997. Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation. In PODC. ACM 25\u201334.","DOI":"10.1145\/259380.259412"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910003"},{"key":"e_1_3_2_1_29_1","unstructured":"K. Kursawe. 2001. Distributed Trust. Ph.\u00a0D. Dissertation. Saarland University.  K. Kursawe. 2001. Distributed Trust. Ph.\u00a0D. Dissertation. Saarland University."},{"key":"e_1_3_2_1_31_1","unstructured":"Nancy\u00a0A Lynch. 1996. Distributed algorithms. Morgan Kaufmann.  Nancy\u00a0A Lynch. 1996. Distributed algorithms. Morgan Kaufmann."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"volume-title":"SCN(LNCS, Vol.\u00a02576)","author":"Maurer M.","key":"e_1_3_2_1_33_1","unstructured":"U.\u00a0 M. Maurer . 2002. Secure Multi-party Computation Made Simple . In SCN(LNCS, Vol.\u00a02576) . Springer , 14\u201328. U.\u00a0M. Maurer. 2002. Secure Multi-party Computation Made Simple. In SCN(LNCS, Vol.\u00a02576). Springer, 14\u201328."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0200-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9172-7"},{"volume-title":"Randomized Byzantine Generals","author":"Rabin O.","key":"e_1_3_2_1_36_1","unstructured":"M.\u00a0 O. Rabin . 1983. Randomized Byzantine Generals . In FOCS. IEEE , 403\u2013409. M.\u00a0O. Rabin. 1983. Randomized Byzantine Generals. In FOCS. IEEE, 403\u2013409."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In STOC. ACM 73\u201385.  T. Rabin and M. Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In STOC. ACM 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_38_1","unstructured":"C. Wang. 2015. Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity. CoRR abs\/1507.06165(2015).  C. Wang. 2015. Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity. CoRR abs\/1507.06165(2015)."}],"event":{"name":"ICDCN 2023: 24th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2023","location":"Kharagpur India"},"container-title":["Proceedings of the 24th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571306.3571333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:53Z","timestamp":1750183673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":37,"alternative-id":["10.1145\/3571306.3571333","10.1145\/3571306"],"URL":"https:\/\/doi.org\/10.1145\/3571306.3571333","relation":{},"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"2023-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}