{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:54Z","timestamp":1750220334756,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"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"}],"funder":[{"name":"ONR","award":["N000142212064"],"award-info":[{"award-number":["N000142212064"]}]},{"name":"NSF","award":["1704788","2044679"],"award-info":[{"award-number":["1704788","2044679"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538427","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"450-459","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Revisiting the Power of Non-Equivocation in Distributed Protocols"],"prefix":"10.1145","author":[{"given":"Naama","family":"Ben-David","sequence":"first","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}]},{"given":"Benjamin Y.","family":"Chan","sequence":"additional","affiliation":[{"name":"Cornell University, New York City, NY, USA"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, 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.1007\/978-3-642-15763-9_3"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331601"},{"key":"e_1_3_2_2_3_1","first-page":"599","volume-title":"14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20)","author":"Aguilera Marcos K","year":"2020","unstructured":"Marcos K Aguilera , Naama Ben-David , Rachid Guerraoui , Virendra J Marathe , Athanasios Xygkis , and Igor Zablotchi . Microsecond consensus for microsecond applications . In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20) , pages 599 -- 616 , 2020 . Marcos K Aguilera, Naama Ben-David, Rachid Guerraoui, Virendra J Marathe, Athanasios Xygkis, and Igor Zablotchi. Microsecond consensus for microsecond applications. In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20), pages 599--616, 2020."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0162-z"},{"key":"e_1_3_2_2_5_1","first-page":"351","volume-title":"14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20)","author":"Alfatafta Mohammed","year":"2020","unstructured":"Mohammed Alfatafta , Basil Alkhatib , Ahmed Alquraan , and Samer Al-Kiswany . Toward a generic fault tolerance technique for partial network partitioning . In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20) , pages 351 -- 368 , 2020 . Mohammed Alfatafta, Basil Alkhatib, Ahmed Alquraan, and Samer Al-Kiswany. Toward a generic fault tolerance technique for partial network partitioning. In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20), pages 351--368, 2020."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611490"},{"key":"e_1_3_2_2_7_1","volume-title":"Brief announcement: Classifying trusted hardware via unidirectional communication","author":"Ben-David Naama","year":"2021","unstructured":"Naama Ben-David and Kartik Nayak . Brief announcement: Classifying trusted hardware via unidirectional communication . 2021 . Naama Ben-David and Kartik Nayak. Brief announcement: Classifying trusted hardware via unidirectional communication. 2021."},{"key":"e_1_3_2_2_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212777"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_18"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_2_15_1","first-page":"173","volume-title":"OSDI","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , Practical byzantine fault tolerance . In OSDI , volume 99 , pages 173 -- 186 , 1999 . Miguel Castro, Barbara Liskov, et al. Practical byzantine fault tolerance. In OSDI, volume 99, pages 173--186, 1999."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294280"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332490"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.9732"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49387-8_8"},{"key":"e_1_3_2_2_21_1","volume-title":"33rd International Symposium on Distributed Computing (DISC 2019","author":"Cohen Ran","year":"2019","unstructured":"Ran Cohen , Iftach Haitner , Nikolaos Makriyannis , Matan Orland , and Alex Samorodnitsky . On the round complexity of randomized byzantine agreement . In 33rd International Symposium on Distributed Computing (DISC 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2019 . Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky. On the round complexity of randomized byzantine agreement. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774187"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335363"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_16"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332491"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_32_1","first-page":"1","volume-title":"NSDI","volume":"9","author":"Levin Dave","year":"2009","unstructured":"Dave Levin , John R Douceur , Jacob R Lorch , and Thomas Moscibroda . Trinc : Small trusted hardware for large distributed systems . In NSDI , volume 9 , pages 1 -- 14 , 2009 . Dave Levin, John R Douceur, Jacob R Lorch, and Thomas Moscibroda. Trinc: Small trusted hardware for large distributed systems. In NSDI, volume 9, pages 1--14, 2009."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.62"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405731"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62588"},{"key":"e_1_3_2_2_37_1","first-page":"305","volume-title":"2014 USENIX Annual Technical Conference (USENIX ATC 14)","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout . In search of an understandable consensus algorithm . In 2014 USENIX Annual Technical Conference (USENIX ATC 14) , pages 305 -- 319 , 2014 . Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In 2014 USENIX Annual Technical Conference (USENIX ATC 14), pages 305--319, 2014."},{"key":"e_1_3_2_2_38_1","volume-title":"Reaching agreement in the presence of faults. Journal of the ACM (JACM), 27(2):228--234","author":"Pease Marshall","year":"1980","unstructured":"Marshall Pease , Robert Shostak , and Leslie Lamport . Reaching agreement in the presence of faults. Journal of the ACM (JACM), 27(2):228--234 , 1980 . Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM (JACM), 27(2):228--234, 1980."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179474.1179485"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363686.1364200"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.19"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314354.1314364"},{"key":"e_1_3_2_2_43_1","first-page":"162","volume-title":"27th Annual Symposium on Foundations of Computer Science (sfcs 1986","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . How to generate and exchange secrets . In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986 ), pages 162 -- 167 . IEEE, 1986 . Andrew Chi-Chih Yao. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 162--167. IEEE, 1986."}],"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:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538427","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538427","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538427","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.3538427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":43,"alternative-id":["10.1145\/3519270.3538427","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538427","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"}}]}}