{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:18:19Z","timestamp":1756311499435,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2061\/19"],"award-info":[{"award-number":["2061\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,19]]},"DOI":"10.1145\/3558535.3559789","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:54:17Z","timestamp":1688568857000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2158-161X","authenticated-orcid":false,"given":"Guy","family":"Goren","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Spiegelman","sequence":"additional","affiliation":[{"name":"Aptos, Palo Alto, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi.","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham , TH Hubert Chan , Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019 . Communication complexity of byzantine agreement, revisited. In PODC. Ittai Abraham, TH Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019. Communication complexity of byzantine agreement, revisited. In PODC."},{"volume-title":"PODC (Toronto ON, Canada) (PODC '19)","author":"Abraham Ittai","key":"e_1_3_2_1_2_1","unstructured":"Ittai Abraham , Dahlia Malkhi , and Alexander Spiegelman . 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement . In PODC (Toronto ON, Canada) (PODC '19) . ACM , New York, NY, USA . Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In PODC (Toronto ON, Canada) (PODC '19). ACM, New York, NY, USA."},{"key":"e_1_3_2_1_3_1","volume-title":"Lower bounds for distributed coin-flipping and randomized consensus. JACM","author":"Aspnes James","year":"1998","unstructured":"James Aspnes . 1998. Lower bounds for distributed coin-flipping and randomized consensus. JACM ( 1998 ). James Aspnes. 1998. Lower bounds for distributed coin-flipping and randomized consensus. JACM (1998)."},{"key":"e_1_3_2_1_4_1","volume-title":"Tight bounds for asynchronous randomized consensus. JACM","author":"Attiya Hagit","year":"2008","unstructured":"Hagit Attiya and Keren Censor . 2008. Tight bounds for asynchronous randomized consensus. JACM ( 2008 ). Hagit Attiya and Keren Censor. 2008. Tight bounds for asynchronous randomized consensus. JACM (2008)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/090751906"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2684017"},{"volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","key":"e_1_3_2_1_7_1","unstructured":"Hagit Attiya and Jennifer Welch . 2004. Distributed computing: fundamentals, simulations, and advanced topics . Vol. 19 . John Wiley & Sons . Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons."},{"key":"e_1_3_2_1_8_1","first-page":"193","article-title":"A tight lower bound for randomized synchronous consensus","volume":"98","author":"Bar-Joseph Ziv","year":"1998","unstructured":"Ziv Bar-Joseph and Michael Ben-Or . 1998 . A tight lower bound for randomized synchronous consensus . In PODC , Vol. 98. 193 -- 199 . Ziv Bar-Joseph and Michael Ben-Or. 1998. A tight lower bound for randomized synchronous consensus. In PODC, Vol. 98. 193--199.","journal-title":"PODC"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. 1983. Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols. In PODC. 27--30.  Michael Ben-Or. 1983. Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols. In PODC. 27--30.","DOI":"10.1145\/800221.806707"},{"volume-title":"Collective coin flipping, robust voting schemes and minima of Banzhaf values","author":"Ben-Or Michael","key":"e_1_3_2_1_10_1","unstructured":"Michael Ben-Or and Nathan Linial . 1985. Collective coin flipping, robust voting schemes and minima of Banzhaf values . In SFCS. IEEE. Michael Ben-Or and Nathan Linial. 1985. Collective coin flipping, robust voting schemes and minima of Banzhaf values. In SFCS. IEEE."},{"key":"e_1_3_2_1_11_1","volume-title":"Asynchronous Byzantine agreement protocols. Inf. Comput. 75, 2","author":"Bracha Gabriel","year":"1987","unstructured":"Gabriel Bracha . 1987. Asynchronous Byzantine agreement protocols. Inf. Comput. 75, 2 ( 1987 ). Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Inf. Comput. 75, 2 (1987)."},{"key":"e_1_3_2_1_12_1","unstructured":"Christian Cachin et al. 2016. Architecture of the hyperledger blockchain fabric. In DCCL.  Christian Cachin et al. 2016. Architecture of the hyperledger blockchain fabric. In DCCL."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. In Advances in Cryptology.  Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. In Advances in Cryptology.","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_14_1","volume-title":"Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Cryptology","author":"Cachin Christian","year":"2005","unstructured":"Christian Cachin , Klaus Kursawe , and Victor Shoup . 2005. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Cryptology ( 2005 ). Christian Cachin, Klaus Kursawe, and Victor Shoup. 2005. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Cryptology (2005)."},{"key":"e_1_3_2_1_15_1","volume-title":"Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, and Roberto Segala.","author":"Canetti Ran","year":"2006","unstructured":"Ran Canetti , Ling Cheung , Dilsun Kirli Kaynar , Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, and Roberto Segala. 2006 . Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. In DISC. Springer . Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, and Roberto Segala. 2006. Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols. In DISC. Springer."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65956"},{"key":"e_1_3_2_1_18_1","volume-title":"Nuno Ferreira Neves, and Paulo Ver\u00edssimo","author":"Correia Miguel","year":"2006","unstructured":"Miguel Correia , Nuno Ferreira Neves, and Paulo Ver\u00edssimo . 2006 . From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures. Computer ( 2006). Miguel Correia, Nuno Ferreira Neves, and Paulo Ver\u00edssimo. 2006. From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures. Computer (2006)."},{"key":"e_1_3_2_1_19_1","volume-title":"Bounds on information exchange for Byzantine agreement. JACM","author":"Dolev Danny","year":"1985","unstructured":"Danny Dolev and Rudiger Reischuk . 1985. Bounds on information exchange for Byzantine agreement. JACM ( 1985 ). Danny Dolev and Rudiger Reischuk. 1985. Bounds on information exchange for Byzantine agreement. JACM (1985)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Faith Ellen Rati Gelashvili and Leqi Zhu. 2018. Revisionist simulations: a new approach to proving space lower bounds. In PODC.  Faith Ellen Rati Gelashvili and Leqi Zhu. 2018. Revisionist simulations: a new approach to proving space lower bounds. In PODC.","DOI":"10.1145\/3212734.3212749"},{"volume-title":"Reasoning about knowledge","author":"Fagin Ronald","key":"e_1_3_2_1_21_1","unstructured":"Ronald Fagin , Yoram Moses , Joseph Y Halpern , and Moshe Y Vardi . 2003. Reasoning about knowledge . MIT press . Ronald Fagin, Yoram Moses, Joseph Y Halpern, and Moshe Y Vardi. 2003. Reasoning about knowledge. MIT press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290183"},{"key":"e_1_3_2_1_24_1","volume-title":"Hundreds of impossibility results for distributed computing. Distributed computing 16, 2--3","author":"Fich Faith","year":"2003","unstructured":"Faith Fich and Eric Ruppert . 2003. Hundreds of impossibility results for distributed computing. Distributed computing 16, 2--3 ( 2003 ), 121--163. Faith Fich and Eric Ruppert. 2003. Hundreds of impossibility results for distributed computing. Distributed computing 16, 2--3 (2003), 121--163."},{"key":"e_1_3_2_1_25_1","volume-title":"Paterson","author":"Fischer Michael J.","year":"1985","unstructured":"Michael J. Fischer , Nancy A. Lynch , and Michael S . Paterson . 1985 . Impossibility of Distributed Consensus with One Faulty Process. JACM ( 1985). Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. JACM (1985)."},{"volume-title":"Foundations of cryptography","author":"Goldreich Oded","key":"e_1_3_2_1_26_1","unstructured":"Oded Goldreich . 2009. Foundations of cryptography : volume 2 , basic applications. Oded Goldreich. 2009. Foundations of cryptography: volume 2, basic applications."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Theory of Computing.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Theory of Computing.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_28_1","series-title":"SIAM Journal on computing 18, 1","volume-title":"The knowledge complexity of interactive proof systems","author":"Goldwasser Shafi","year":"1989","unstructured":"Shafi Goldwasser , Silvio Micali , and Charles Rackoff . 1989. The knowledge complexity of interactive proof systems . SIAM Journal on computing 18, 1 ( 1989 ), 186--208. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1989. The knowledge complexity of interactive proof systems. SIAM Journal on computing 18, 1 (1989), 186--208."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357214"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_1_31_1","volume-title":"Byzantine agreement in expected polynomial time. JACM","author":"King Valerie","year":"2016","unstructured":"Valerie King and Jared Saia . 2016. Byzantine agreement in expected polynomial time. JACM ( 2016 ). Valerie King and Jared Saia. 2016. Byzantine agreement in expected polynomial time. JACM (2016)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Eyal Kushilevitz Yishay Mansour Michael O Rabin and David Zuckerman. 1993. Lower bounds for randomized mutual exclusion. In Theory of computing.  Eyal Kushilevitz Yishay Mansour Michael O Rabin and David Zuckerman. 1993. Lower bounds for randomized mutual exclusion. In Theory of computing.","DOI":"10.1145\/167088.167139"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Nancy Lynch. 1989. A hundred impossibility proofs for distributed computing. In PODC.  Nancy Lynch. 1989. A hundred impossibility proofs for distributed computing. In PODC.","DOI":"10.1145\/72981.72982"},{"volume-title":"Distributed algorithms","author":"Lynch Nancy A","key":"e_1_3_2_1_34_1","unstructured":"Nancy A Lynch . 1996. Distributed algorithms . Elsevier . Nancy A Lynch. 1996. Distributed algorithms. Elsevier."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3335772"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Ueli M. Maurer. 2002. Indistinguishability of Random Systems. In EUROCRYPT.  Ueli M. Maurer. 2002. Indistinguishability of Random Systems. In EUROCRYPT.","DOI":"10.1007\/3-540-46035-7_8"},{"key":"e_1_3_2_1_37_1","unstructured":"Silvio Micali Michael Rabin and Salil Vadhan. 1999. Verifiable random functions. In STOC.  Silvio Micali Michael Rabin and Salil Vadhan. 1999. Verifiable random functions. In STOC."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Yoram Moses and Sergio Rajsbaum. 1998. The unified structure of consensus: a layered analysis approach. In PODC.  Yoram Moses and Sergio Rajsbaum. 1998. The unified structure of consensus: a layered analysis approach. In PODC.","DOI":"10.1145\/277697.277720"},{"key":"e_1_3_2_1_39_1","volume-title":"Distributed consensus revisited. Information processing letters","author":"Neiger Gil","year":"1994","unstructured":"Gil Neiger . 1994. Distributed consensus revisited. Information processing letters ( 1994 ). Gil Neiger. 1994. Distributed consensus revisited. Information processing letters (1994)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Amir Pnueli. 1983. On the extremely fair treatment of probabilistic algorithms. In Theory of computing.  Amir Pnueli. 1983. On the extremely fair treatment of probabilistic algorithms. In Theory of computing.","DOI":"10.1145\/800061.808757"},{"key":"e_1_3_2_1_42_1","volume-title":"Probabilistic algorithms in finite fields. Journal on computing","author":"Rabin Michael O","year":"1980","unstructured":"Michael O Rabin . 1980. Probabilistic algorithms in finite fields. Journal on computing ( 1980 ). Michael O Rabin. 1980. Probabilistic algorithms in finite fields. Journal on computing (1980)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Michael O Rabin. 1983. Randomized byzantine generals. In SFCS.  Michael O Rabin. 1983. Randomized byzantine generals. In SFCS.","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_44_1","article-title":"Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n\/3, O(n2) messages, and constant time","volume":"54","author":"Raynal Michel","year":"2017","unstructured":"Michel Raynal and Achour Most\u00e9faoui . 2017 . Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n\/3, O(n2) messages, and constant time . Acta Informatica 54 , 5 (2017). Michel Raynal and Achour Most\u00e9faoui. 2017. Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n\/3, O(n2) messages, and constant time. Acta Informatica 54, 5 (2017).","journal-title":"Acta Informatica"},{"volume-title":"Modeling and verification of randomized distributed real-time systems. Ph. D","author":"Segala Roberto","key":"e_1_3_2_1_45_1","unstructured":"Roberto Segala . 1995. Modeling and verification of randomized distributed real-time systems. Ph. D . Dissertation . Cambridge . Roberto Segala. 1995. Modeling and verification of randomized distributed real-time systems. Ph. D. Dissertation. Cambridge."},{"key":"e_1_3_2_1_46_1","first-page":"250","article-title":"Probabilistic Simulations for Probabilistic Processes","volume":"2","author":"Segala Roberto","year":"1995","unstructured":"Roberto Segala and Nancy A. Lynch . 1995 . Probabilistic Simulations for Probabilistic Processes . Nord. J. Comput. 2 , 2 (1995), 250 -- 273 . Roberto Segala and Nancy A. Lynch. 1995. Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2, 2 (1995), 250--273.","journal-title":"Nord. J. Comput."},{"volume-title":"Concord: An Open Source Decentralized Trust Infrastructure.","year":"2018","key":"e_1_3_2_1_47_1","unstructured":"VMware. 2018 . Concord: An Open Source Decentralized Trust Infrastructure. VMware. 2018. Concord: An Open Source Decentralized Trust Infrastructure."},{"key":"e_1_3_2_1_48_1","volume-title":"18th Annual Symposium on Foundations of Computer Science (sfcs","author":"Chi-Chin Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chin Yao . 1977 . Probabilistic computations: Toward a unified measure of complexity . In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE Computer Society, 222--227. Andrew Chi-Chin Yao. 1977. Probabilistic computations: Toward a unified measure of complexity. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE Computer Society, 222--227."},{"key":"e_1_3_2_1_49_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In SFCS.  Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In SFCS."}],"event":{"name":"AFT '22: 4th ACM Conference on Advances in Financial Technologies","acronym":"AFT '22","location":"Cambridge MA USA"},"container-title":["Proceedings of the 4th ACM Conference on Advances in Financial Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559789","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558535.3559789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:09Z","timestamp":1750178829000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558535.3559789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":49,"alternative-id":["10.1145\/3558535.3559789","10.1145\/3558535"],"URL":"https:\/\/doi.org\/10.1145\/3558535.3559789","relation":{},"subject":[],"published":{"date-parts":[[2022,9,19]]},"assertion":[{"value":"2023-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}