Iterative approximate byzantine consensus in arbitrary directed graphs

DOI10.1145/2332432.2332505zbMATH Open1301.68168arXiv1201.4183OpenAlexW2025375132MaRDI QIDQ2933813FDOQ2933813

Lewis Tseng, Nitin H. Vaidya, Guanfeng Liang

Publication date: 5 December 2014

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

Abstract: In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs.

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

zbMATH Keywords

consensusiterative algorithmsByzantine faults

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (28)

• Defending non-Bayesian learning against adversarial attacks
• Title not available (Why is that?)
• Broadcast using certified propagation algorithm in presence of Byzantine faults
• Resilient coordinated movement of connected autonomous vehicles
• Resilience against misbehaving nodes in asynchronous networks
• Resilient consensus of second-order agent networks: asynchronous update rules with delays
• Consensus of second-order multi-agent systems in the presence of locally bounded faults
• Reaching approximate Byzantine consensus with multi-hop communication
• Resilient distributed averaging: adversary detection and topological insights
• Approximate agreement under mobile Byzantine faults
• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Bipartite Byzantine‐resilient event‐triggered consensus control of heterogeneous multi‐agent systems
• Multi-armed bandit based distributed resilient consensus and its applications in social networks
• Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
• Resilient group consensus in the presence of Byzantine agents
• Secure consensus with distributed detection via two-hop communication
• Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
• Resilient self/event-triggered consensus based on ternary control
• Resilient output regulation in heterogeneous networked systems under Byzantine agents
• Spectral and structural properties of random interdependent networks
• Consensus Algorithm with Censored Data for Distributed Detection with Corrupted Measurements: A Game-Theoretic Approach
• Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
• Byzantine-resilient distributed observers for LTI systems
• Resilient consensus for multi-agent systems subject to differential privacy requirements
• Resilient multi-dimensional consensus in adversarial environment
• Finite-time error bounds for distributed linear stochastic approximation
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• Reaching Approximate Byzantine Consensus with Multi-hop Communication

This page was built for publication: Iterative approximate byzantine consensus in arbitrary directed graphs

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