Achieving Optimal Breakdown for Byzantine Robust Gossip
Achieving Optimal Breakdown for Byzantine Robust Gossip
Distributed approaches have many computational benefits, but they are vulnerable to attacks from a subset of devices transmitting incorrect information. This paper investigates Byzantine-resilient algorithms in a decentralized setting, where devices communicate directly with one another. We investigate the notion of breakdown point, and show an upper bound on the …