The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Challenges in Intrusion Detection for Wireless Ad-hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
An integrated token-based algorithm for scalable coordination
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE Transactions on Dependable and Secure Computing
Efficient control of epidemics over random networks
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
A mathematical analysis of collective cognitive convergence
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Exploiting scale invariant dynamics for efficient information propagation in large teams
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Efficient opinion sharing in large decentralised teams
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Dynamic facts in large team information sharing
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Large heterogeneous teams in a variety of applications must make joint decisions using large volumes of noisy and uncertain data. Often not all team members have access to a sensor, relying instead on information shared by peers to make decisions. These sensors can become permanently corrupted through hardware failure or as a result of the actions of a malicious adversary. Previous work showed that when the trust between agents was tuned to a specific value the resulting dynamics of the system had a property called scale invariance which led to agents reaching highly accurate conclusion with little communication. In this paper we show that these dynamics also leave the system vulnerable to most agents coming to incorrect conclusions as a result of small amounts of anomalous information maliciously injected in the system. We conduct an analysis that shows that the efficiency of scale invariant dynamics is due to the fact that large number of agents can come to correct conclusions when the difference between the percentage of agents holding conflicting opinions is relatively small. Although this allows the system to come to correct conclusions quickly, it also means that it would be easy for an attacker with specific knowledge to tip the balance. We explore different methods for selecting which agents are Byzantine and when attacks are launched informed by the analysis. Our study reveals global system properties that can be used to predict when and where in the network the system is most vulnerable to attack. We use the results of this study to design an algorithm used by agents to effectively attack the network, informed by local estimates of the global properties revealed by our investigation.