Multidimensional approximate agreement in Byzantine asynchronous systems

DOI10.1145/2488608.2488657MaRDI QIDQ5495809zbMATH OpenOpenAlexWikidataFDO

Authors Hammurabi Mendes, Maurice Herlihy

Publication date 7 August 2014

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

asynchronous systemshigher dimensionapproximate agreementByzantine protocols

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Multidimensional agreement in Byzantine systems
• Principles of Distributed Systems
• Reaching approximate agreement in the presence of faults
• Byzantine approximate agreement on graphs
• Fast multidimensional asymptotic and approximate consensus

Cited in

(21)

• Defending non-Bayesian learning against adversarial attacks
• Brief announcement: Communication-optimal convex agreement
• All Byzantine agreement problems are expensive
• Principles of Distributed Systems
• Managed agreement: generalizing two fundamental distributed agreement problems
• Brief Announcement: Byzantine Geoconsensus
• Approximate agreement under mobile Byzantine faults
• Byzantine approximate agreement on graphs
• Recent results on fault-tolerant consensus in message-passing networks
• Relaxed Byzantine vector consensus
• Fast multidimensional asymptotic and approximate consensus
• Byzantine vector consensus in complete graphs
• Secure multi-dimensional consensus algorithm against malicious attacks
• Multidimensional agreement in Byzantine systems
• On the Validity of Consensus
• Resilient output regulation in heterogeneous networked systems under Byzantine agents
• Reaching approximate agreement in the presence of faults
• Mutual information agreement in multicomputer systems with the detection and identification of Byzantine faults
• Centroid approximation with multidimensional approximate agreement protocols
• Byzantine preferential voting
• Resilient multi-dimensional consensus in adversarial environment

This page was built for publication: Multidimensional approximate agreement in Byzantine asynchronous systems

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