Byzantine vector consensus in complete graphs

DOI10.1145/2484239.2484256MaRDI QIDQ5176083zbMATH OpenOpenAlexWikidataFDO

Authors Nitin H. Vaidya, Vijay K. Garg

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

asynchronous and synchronous systemsByzantine consensusvector inputs

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Abstract: Consider a network of n processes each of which has a d-dimensional vector of reals as its input. Each process can communicate directly with all the processes in the system; thus the communication network is a complete graph. All the communication channels are reliable and FIFO (first-in-first-out). The problem of Byzantine vector consensus (BVC) requires agreement on a d-dimensional vector that is in the convex hull of the d-dimensional input vectors at the non-faulty processes. We obtain the following results for Byzantine vector consensus in complete graphs while tolerating up to f Byzantine failures: * We prove that in a synchronous system, n >= max(3f+1, (d+1)f+1) is necessary and sufficient for achieving Byzantine vector consensus. * In an asynchronous system, it is known that exact consensus is impossible in presence of faulty processes. For an asynchronous system, we prove that n >= (d+2)f+1 is necessary and sufficient to achieve approximate Byzantine vector consensus. Our sufficiency proofs are constructive. We show sufficiency by providing explicit algorithms that solve exact BVC in synchronous systems, and approximate BVC in asynchronous systems. We also obtain tight bounds on the number of processes for achieving BVC using algorithms that are restricted to a simpler communication pattern.

Recommendations

• Multidimensional agreement in Byzantine systems
• Relaxed Byzantine vector consensus
• Byzantine approximate agreement on graphs
• Multidimensional approximate agreement in Byzantine asynchronous systems
• Minimal synchrony for Byzantine consensus

Cited in

(15)

• Resilient distributed vector consensus using centerpoint
• Resilient multi-dimensional consensus in adversarial environment
• Byzantine preferential voting
• Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
• Defending non-Bayesian learning against adversarial attacks
• Fault-tolerant consensus in directed graphs
• Recent results on fault-tolerant consensus in message-passing networks
• Relaxed Byzantine vector consensus
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• On the Validity of Consensus
• Brief Announcement: Byzantine Geoconsensus
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Brief announcement: Communication-optimal convex agreement
• Centroid approximation with multidimensional approximate agreement protocols
• Multidimensional agreement in Byzantine systems

This page was built for publication: Byzantine vector consensus in complete graphs

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