{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335725,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538461","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"103-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup"],"prefix":"10.1145","author":[{"given":"Luciano","family":"Freitas","sequence":"first","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, Palaiseau, France"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, Palaiseau, France"}]},{"given":"Andrei","family":"Tonkikh","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1145\/3465084.3467914"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1016\/0890-5401(87)90054-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.5555\/1972495"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1145\/167088.167105"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/3460120.3484808"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1145\/5925.5931"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_8_1","volume-title":"Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878","author":"Freitas Luciano","year":"2022","unstructured":"Luciano Freitas , Petr Kuznetsov , and Andrei Tonkikh . Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878 , 2022 . Luciano Freitas, Petr Kuznetsov, and Andrei Tonkikh. Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878, 2022."},{"key":"e_1_3_2_2_9_1","volume-title":"Efficient asynchronous byzantine agreement without private setups. arXiv preprint arXiv:2106.07831","author":"Gao Yingzi","year":"2021","unstructured":"Yingzi Gao , Yuan Lu , Zhenliang Lu , Qiang Tang , Jing Xu , and Zhenfeng Zhang . Efficient asynchronous byzantine agreement without private setups. arXiv preprint arXiv:2106.07831 , 2021 . Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Efficient asynchronous byzantine agreement without private setups. arXiv preprint arXiv:2106.07831, 2021."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1007\/978-3-030-77870-5_6"},{"key":"e_1_3_2_2_11_1","volume-title":"Signature-free asynchronous binary byzantine consensus with t < n\/3, o(n2) messages, and o(1) expected time. J. ACM, 62(4), sep","author":"Most\u00e9faoui Achour","year":"2015","unstructured":"Achour Most\u00e9faoui , Hamouma Moumen , and Michel Raynal . Signature-free asynchronous binary byzantine consensus with t < n\/3, o(n2) messages, and o(1) expected time. J. ACM, 62(4), sep 2015 . doi:10.1145\/2785953. 10.1145\/2785953 Achour Most\u00e9faoui, Hamouma Moumen, and Michel Raynal. Signature-free asynchronous binary byzantine consensus with t < n\/3, o(n2) messages, and o(1) expected time. J. ACM, 62(4), sep 2015. doi:10.1145\/2785953."},{"key":"e_1_3_2_2_12_1","volume-title":"Living with asynchrony: the gather protocol. https:\/\/tinyurl.com\/2s63r3jz","author":"Stern Gilad","year":"2021","unstructured":"Gilad Stern and Ittai Abraham . Living with asynchrony: the gather protocol. https:\/\/tinyurl.com\/2s63r3jz , 2021 . Accessed : 2022-02--12. Gilad Stern and Ittai Abraham. Living with asynchrony: the gather protocol. https:\/\/tinyurl.com\/2s63r3jz, 2021. Accessed: 2022-02--12."}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '22","name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy"},"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.3538461","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538461","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:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":12,"alternative-id":["10.1145\/3519270.3538461","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538461","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"}}]}}