Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience

DOI10.1145/3382734.3405722MaRDI QIDQ5855217zbMATH OpenOpenAlexFDO

Authors Ittai Abraham, Danny Dolev, Gilad Stern

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.16686

Mathematics Subject Classification ID

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

Cited in

(11)

• Optimal fault-tolerant computing on multiprocessor systems
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Transparent fault tolerance for scalable functional computation
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
• Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
• Network agnostic MPC with statistical security
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Linear-communication asynchronous complete secret sharing with optimal resilience
• Computationally efficient asynchronous MPC with linear communication and low additive overhead
• Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents

This page was built for publication: Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience

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