{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:54Z","timestamp":1766281014891,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ERC","award":["716562"],"award-info":[{"award-number":["716562"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538444","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"440-449","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimal Clock Synchronization with Signatures"],"prefix":"10.1145","author":[{"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_1_2_1","volume-title":"Complexity of network synchronization. Journal of the ACM (JACM), 32(4):804-823","author":"Awerbuch Baruch","year":"1985","unstructured":"Baruch Awerbuch . Complexity of network synchronization. Journal of the ACM (JACM), 32(4):804-823 , 1985 . Baruch Awerbuch. Complexity of network synchronization. Journal of the ACM (JACM), 32(4):804-823, 1985."},{"key":"e_1_3_2_1_3_1","volume-title":"Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters (IPL), 80(3):151-157","author":"Biaz Sa\u00e2d","year":"2001","unstructured":"Sa\u00e2d Biaz and Jennifer L. Welch . Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters (IPL), 80(3):151-157 , 2001 . Sa\u00e2d Biaz and Jennifer L. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters (IPL), 80(3):151-157, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808720"},{"key":"e_1_3_2_1_7_1","volume-title":"Clock synchronization and adversarial fault tolerance. Online lecture notes","author":"Dolev Danny","year":"2021","unstructured":"Danny Dolev and Christoph Lenzen . Clock synchronization and adversarial fault tolerance. Online lecture notes , 2021 . https:\/\/www.mpiinf. mpg.de\/departments\/algorithms-complexity\/teaching\/summer21\/clocksynchronization- and-adversarial-fault-tolerance. Danny Dolev and Christoph Lenzen. Clock synchronization and adversarial fault tolerance. Online lecture notes, 2021. https:\/\/www.mpiinf. mpg.de\/departments\/algorithms-complexity\/teaching\/summer21\/clocksynchronization- and-adversarial-fault-tolerance."},{"key":"e_1_3_2_1_8_1","volume-title":"Reaching approximate agreement in the presence of faults. Journal of the ACM (JACM), 33(3):499-516","author":"Dolev Danny","year":"1986","unstructured":"Danny Dolev , Nancy A. Lynch , Shlomit S. Pinter , Eugene W. Stark , and William E. Weihl . Reaching approximate agreement in the presence of faults. Journal of the ACM (JACM), 33(3):499-516 , 1986 . Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, EugeneW. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM (JACM), 33(3):499-516, 1986."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806739"},{"key":"e_1_3_2_1_13_1","volume-title":"Self-stabilizing byzantine clock synchronization with optimal precision. Theory of Computing Systems (TOCS), 63:261--305","author":"Khanchandani Pankaj","year":"2018","unstructured":"Pankaj Khanchandani and Christoph Lenzen . Self-stabilizing byzantine clock synchronization with optimal precision. Theory of Computing Systems (TOCS), 63:261--305 , 2018 . Pankaj Khanchandani and Christoph Lenzen. Self-stabilizing byzantine clock synchronization with optimal precision. Theory of Computing Systems (TOCS), 63:261--305, 2018."},{"key":"e_1_3_2_1_14_1","first-page":"68","volume-title":"Lamport and P. M. Melliar-Smith. Byzantine Clock Synchronization. In ACM Symposium on Principles of Distributed Computing (PODC)","author":"Leslie","year":"1984","unstructured":"Leslie Lamport and P. M. Melliar-Smith. Byzantine Clock Synchronization. In ACM Symposium on Principles of Distributed Computing (PODC) , pages 68 -- 74 , 1984 . Leslie Lamport and P. M. Melliar-Smith. Byzantine Clock Synchronization. In ACM Symposium on Principles of Distributed Computing (PODC), pages 68--74, 1984."},{"key":"e_1_3_2_1_15_1","volume-title":"The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401","author":"Lamport Leslie","year":"1982","unstructured":"Leslie Lamport , Robert E. Shostak , and Marshall C. Pease . The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401 , 1982 . Leslie Lamport, Robert E. Shostak, and Marshall C. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401, 1982."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538444"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806738"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323603"}],"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.3538444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538444","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.3538444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":18,"alternative-id":["10.1145\/3519270.3538444","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538444","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"}}]}}