{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:45:28Z","timestamp":1761396328728,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"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:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2439\/20"],"award-info":[{"award-number":["2439\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union?s Horizon 2020 research and innovation programme","award":["891234"],"award-info":[{"award-number":["891234"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538451","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"392-398","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"VMware Research, Herzelia, Israel"}]},{"given":"Gilad","family":"Asharov","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]}],"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":"Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. to appear in PODC","author":"Alhaddad Nicolas","year":"2022","unstructured":"Nicolas Alhaddad , Sourav Das , Sisi Duan , Ling Ren , Mayank Varia , Zhuolun Xiang , and Haibin Zhang . 2022. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. to appear in PODC 2022 . Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. 2022. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. to appear in PODC 2022."},{"key":"e_1_3_2_2_3_1","volume-title":"Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. to appear in PODC","author":"Alhaddad Nicolas","year":"2022","unstructured":"Nicolas Alhaddad , Sourav Das , Sisi Duan , Ling Ren , Mayank Varia , Zhuolun Xiang , and Haibin Zhang . 2022 . Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. to appear in PODC 2022. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. 2022. Brief Announcement: Asynchronous Verifiable Information Dispersal with Near-Optimal Communication. to appear in PODC 2022."},{"key":"e_1_3_2_2_5_1","volume-title":"Hoch","author":"Ben-Or Michael","year":"2010","unstructured":"Michael Ben-Or , Danny Dolev , and Ezra N . Hoch . 2010 . Brief Announcement : Simple Gradecast Based Algorithms. In DISC (Lecture Notes in Computer Science , Vol. 6343). Springer, 194-- 197 . Michael Ben-Or, Danny Dolev, and Ezra N. Hoch. 2010. Brief Announcement: Simple Gradecast Based Algorithms. In DISC (Lecture Notes in Computer Science, Vol. 6343). Springer, 194--197."},{"key":"e_1_3_2_2_6_1","volume-title":"Hoch","author":"Ben-Or Michael","year":"2010","unstructured":"Michael Ben-Or , Danny Dolev , and Ezra N . Hoch . 2010 . Simple Gradecast Based Algorithms. CoRR abs\/1007.1049 (2010). Michael Ben-Or, Danny Dolev, and Ezra N. Hoch. 2010. Simple Gradecast Based Algorithms. CoRR abs\/1007.1049 (2010)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_8_1","volume-title":"24th IEEE Symposium on Reliable Distributed Systems (SRDS'05)","author":"Cachin C.","year":"2005","unstructured":"C. Cachin and S. Tessaro . 2005. Asynchronous verifiable information dispersal . In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05) . 191--201. https: \/\/doi.org\/10.1109\/RELDIS. 2005 .9 10.1109\/RELDIS.2005.9 C. Cachin and S. Tessaro. 2005. Asynchronous verifiable information dispersal. In 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05). 191--201. https: \/\/doi.org\/10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_10_1","volume-title":"Optimal Error-Free Multi-Valued Byzantine Agreement. In 35th International Symposium on Distributed Computing (DISC 2021) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"19","author":"Chen Jinyuan","year":"2021","unstructured":"Jinyuan Chen . 2021 . Optimal Error-Free Multi-Valued Byzantine Agreement. In 35th International Symposium on Distributed Computing (DISC 2021) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 17:1--17: 19 . https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.4230\/LIPIcs.DISC.2021.17 10.4230\/LIPIcs.DISC.2021.17 Jinyuan Chen. 2021. Optimal Error-Free Multi-Valued Byzantine Agreement. In 35th International Symposium on Distributed Computing (DISC 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl -- Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 17:1--17:19. https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.4230\/LIPIcs.DISC.2021.17"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571841"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_2_20_1","volume-title":"EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings (Lecture Notes in Computer Science","volume":"226","author":"Zippel Richard","year":"1979","unstructured":"Richard Zippel . 1979 . Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation , EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings (Lecture Notes in Computer Science , Vol. 72), Edward W. Ng (Ed.). Springer, 216-- 226 Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation, EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings (Lecture Notes in Computer Science, Vol. 72), Edward W. Ng (Ed.). Springer, 216--226"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3519270.3538451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3519270.3538451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":17,"alternative-id":["10.1145\/3519270.3538451","10.1145\/3519270"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3519270.3538451","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"}}]}}