Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Algorithmic Aspects of Graph Connectivity
Algorithmic Aspects of Graph Connectivity
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Consensus of multi-agent networks in the presence of adversaries using only local information
Proceedings of the 1st international conference on High Confidence Networked Systems
Resilient synchronization in robust networked multi-agent systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.89 |
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a certified propagation algorithm (CPA), which is the only algorithm we know that does not use any global knowledge of the network topology. Hence, it is worth focusing on a graph-theoretic parameter such that CPA will work correctly. Using the theory of maximum adjacency (MA) ordering, a new graph-theoretic parameter for CPA is proposed. Within a factor of two, this parameter approximates the largest t such that CPA works for t-locally bounded Byzantine faults.