Optimal Clock Synchronization with Signatures-Reference-Cited by-同舟云学术

Optimal Clock Synchronization with Signatures

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Lenzen Christoph¹,Loss Julian¹

Affiliation:

1. CISPA Helmholtz Center for Information Security, Saarbruecken, Germany

Funder

ERC

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519270.3538444

Reference18 articles.

1. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected $$O(n^2)$$ Communication, and Optimal Resilience

2. 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.

3. Saâd 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âd Biaz and Jennifer L. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters (IPL), 80(3):151-157, 2001.

4. The Byzantine generals strike again

5. The Byzantine generals strike again

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Communication-Optimal Convex Agreement;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Optimal Clock Synchronization with Signatures;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

3. Permissionless Clock Synchronization with Public Setup;Theory of Cryptography;2022