{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:44:39Z","timestamp":1782971079077,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"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":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467907","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"355-362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A New Way to Achieve Round-Efficient Byzantine Agreement"],"prefix":"10.1145","author":[{"given":"Matthias","family":"Fitzi","sequence":"first","affiliation":[{"name":"IOHK, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"University of Maryland, Maryland, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_2_3_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov . 1999 . Practical Byzantine fault tolerance . In OSDI , Vol. 99. 173 -- 186 . Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_3_2_2_4_1","volume-title":"arXiv preprint arXiv:1607.01341","author":"Chen Jing","year":"2016","unstructured":"Jing Chen and Silvio Micali . 2016. Algorand. arXiv preprint arXiv:1607.01341 ( 2016 ). Jing Chen and Silvio Micali. 2016. Algorand. arXiv preprint arXiv:1607.01341 (2016)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_9"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0308-x"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90014-9"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_2_12_1","volume-title":"Garay","author":"Fitzi Matthias","year":"2003","unstructured":"Matthias Fitzi and Juan A . Garay . 2003 . Efficient player-optimal protocols for strong and differential consensus. In 22nd ACM PODC, Elizabeth Borowsky and Sergio Rajsbaum (Eds.). ACM , 211--220. https:\/\/doi.org\/10.1145\/872035.872066 10.1145\/872035.872066 Matthias Fitzi and Juan A. Garay. 2003. Efficient player-optimal protocols for strong and differential consensus. In 22nd ACM PODC, Elizabeth Borowsky and Sergio Rajsbaum (Eds.). ACM, 211--220. https:\/\/doi.org\/10.1145\/872035.872066"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.44"},{"key":"e_1_3_2_2_14_1","volume-title":"On Expected Constant-Round Protocols for Byzantine Agreement. In CRYPTO 2006 (LNCS","volume":"462","author":"Katz Jonathan","year":"2006","unstructured":"Jonathan Katz and Chiu-Yuen Koo . 2006 . On Expected Constant-Round Protocols for Byzantine Agreement. In CRYPTO 2006 (LNCS , Vol. 4117), Cynthia Dwork (Ed.). Springer, Heidelberg, 445-- 462 . https:\/\/doi.org\/10.1007\/11818175_27 10.1007\/11818175_27 Jonathan Katz and Chiu-Yuen Koo. 2006. On Expected Constant-Round Protocols for Byzantine Agreement. In CRYPTO 2006 (LNCS, Vol. 4117), Cynthia Dwork (Ed.). Springer, Heidelberg, 445--462. https:\/\/doi.org\/10.1007\/11818175_27"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_16_1","volume-title":"33rd ACM PODC, Magn\u00fas M","author":"Libert Beno\u00eet","unstructured":"Beno\u00eet Libert , Marc Joye , and Moti Yung . 2014. Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares . In 33rd ACM PODC, Magn\u00fas M . Halld\u00f3rsson and Shlomi Dolev (Eds.). ACM , 303--312. https:\/\/doi.org\/10.1145\/2611462.2611498 10.1145\/2611462.2611498 Beno\u00eet Libert, Marc Joye, and Moti Yung. 2014. Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. In 33rd ACM PODC, Magn\u00fas M. Halld\u00f3rsson and Shlomi Dolev (Eds.). ACM, 303--312. https:\/\/doi.org\/10.1145\/2611462.2611498"},{"key":"e_1_3_2_2_17_1","volume-title":"21st ACM PODC, Aleta Ricciardi (Ed.). ACM, 203--212. https:\/\/doi.org\/10.1145\/571825.571859","author":"Lindell Yehuda","unstructured":"Yehuda Lindell , Anna Lysyanskaya , and Tal Rabin . 2002. Sequential composition of protocols without simultaneous termination . In 21st ACM PODC, Aleta Ricciardi (Ed.). ACM, 203--212. https:\/\/doi.org\/10.1145\/571825.571859 10.1145\/571825.571859 Yehuda Lindell, Anna Lysyanskaya, and Tal Rabin. 2002. Sequential composition of protocols without simultaneous termination. In 21st ACM PODC, Aleta Ricciardi (Ed.). ACM, 203--212. https:\/\/doi.org\/10.1145\/571825.571859"},{"key":"e_1_3_2_2_18_1","unstructured":"Silvio Micali and Vinod Vaikuntanathan. 2017. Optimal and player-replaceable consensus with an honest majority. (2017).  Silvio Micali and Vinod Vaikuntanathan. 2017. Optimal and player-replaceable consensus with an honest majority. (2017)."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762112"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90027-9"},{"key":"e_1_3_2_2_22_1","unstructured":"Oliver von Rotz. 2000. Reduktion von informationstheoretisch sicheren Konsistenzprimitiven. Master's thesis ETH Z\u00fcrich.  Oliver von Rotz. 2000. Reduktion von informationstheoretisch sicheren Konsistenzprimitiven. Master's thesis ETH Z\u00fcrich."}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":22,"alternative-id":["10.1145\/3465084.3467907","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467907","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}