The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
SIAM Journal on Computing
Distributed algorithms for reaching consensus on general functions
Automatica (Journal of IFAC)
Research challenges for the security of control systems
HOTSEC'08 Proceedings of the 3rd conference on Hot topics in security
Brief paper: Synchronization in networks of identical linear systems
Automatica (Journal of IFAC)
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Information Processing Letters
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Theoretical Computer Science
Consensus in networked multi-agent systems with adversaries
Proceedings of the 14th international conference on Hybrid systems: computation and control
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Low complexity resilient consensus in networked multi-agent systems with adversaries
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Decentralized Perimeter Surveillance Using a Team of UAVs
IEEE Transactions on Robotics
Distributed function calculation and consensus using linear iterative strategies
IEEE Journal on Selected Areas in Communications
Iterative approximate byzantine consensus in arbitrary directed graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Automatica (Journal of IFAC)
Brief announcement: reaching approximate byzantine consensus in partially-connected mobile networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Resilient synchronization in robust networked multi-agent systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Algorithms for determining network robustness
Proceedings of the 2nd ACM international conference on High confidence networked systems
| Hi-index | 0.00 |
This paper addresses the problem of resilient consensus in the presence of misbehaving nodes. Although it is typical to assume knowledge of at least some nonlocal information when studying secure and fault-tolerant consensus algorithms, this assumption is not suitable for large-scale dynamic networks. To remedy this, we emphasize the use of local strategies to deal with resilience to security breaches. We study a consensus protocol that uses only local information and we consider worst-case security breaches, where the compromised nodes have full knowledge of the network and the intentions of the other nodes. We provide necessary and sufficient conditions for the normal nodes to reach consensus despite the influence of the malicious nodes under different threat assumptions. These conditions are stated in terms of a novel graph-theoretic property referred to as network robustness.