Iterative approximate byzantine consensus in arbitrary directed graphs

DOI10.1145/2332432.2332505zbMath1301.68168arXiv1201.4183OpenAlexW2025375132MaRDI QIDQ2933813

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)

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

zbMATH Keywords

iterative algorithmsconsensusByzantine faults

Mathematics Subject Classification ID

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

Related Items (24)

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

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