Optimal Synchronous Approximate Agreement with Asynchronous Fallback

DOI10.1145/3519270.3538442OpenAlexW4286210688WikidataQ130957598 ScholiaQ130957598MaRDI QIDQ6202005FDOQ6202005

Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer

Publication date: 26 March 2024

Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3519270.3538442

zbMATH Keywords

hybrid protocolsapproximate agreement

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (4)

• Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees
• Network agnostic MPC with statistical security
• Network-agnostic multi-party computation revisited (extended abstract)
• Closing the efficiency gap between synchronous and network-agnostic consensus

This page was built for publication: Optimal Synchronous Approximate Agreement with Asynchronous Fallback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202005)