Optimal Synchronous Approximate Agreement with Asynchronous Fallback

DOI10.1145/3519270.3538442MaRDI QIDQ6202005zbMATH OpenOpenAlexWikidataFDO

Authors 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

approximate agreementhybrid protocols

Mathematics Subject Classification ID

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

Cited in

(10)

• 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
• Brief announcement: Communication-optimal convex agreement
• All Byzantine agreement problems are expensive
• Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
• An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
• Information-theoretic network-agnostic MPC with polynomial communication
• Perfectly secure network-agnostic MPC comes for free

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)