Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations

TL;DR

This paper introduces robust gossip algorithms capable of accurately computing approximate quantiles and means even in the presence of adversarial message corruptions, ensuring reliable aggregation in unreliable networks.

Contribution

It develops simple yet effective gossip algorithms that are resilient to adversarial corruptions, with rigorous analysis demonstrating their optimal efficiency and robustness.

Findings

Algorithms achieve convergence despite adversarial corruptions.

Robust algorithms maintain near-optimal efficiency.

Analysis shows resilience under powerful corruption models.

Abstract

This paper presents gossip algorithms for aggregation tasks that demonstrate both robustness to adversarial corruptions of any order of magnitude and optimality across a substantial range of these corruption levels. Gossip algorithms distribute information in a scalable and efficient way by having random pairs of nodes exchange small messages. Value aggregation problems are of particular interest in this setting, as they occur frequently in practice, and many elegant algorithms have been proposed for computing aggregates and statistics such as averages and quantiles. An important and well-studied advantage of gossip algorithms is their robustness to message delays, network churn, and unreliable message transmissions. However, these crucial robustness guarantees only hold if all nodes follow the protocol and no messages are corrupted. In this paper, we remedy this by providing a framework to model both adversarial participants and message corruptions in gossip-style communications by allowing an adversary to control a small fraction of the nodes or corrupt messages arbitrarily. Despite this very powerful and general corruption model, we show that robust gossip algorithms can be designed for many important aggregation problems. Our algorithms guarantee that almost all nodes converge to an approximately correct answer with optimal efficiency and essentially as fast as without corruptions. The design of adversarially-robust gossip algorithms poses completely new challenges. Despite this, our algorithms remain very simple variations of known non-robust algorithms with often only subtle changes to avoid non-compliant nodes gaining too much influence over outcomes. While our algorithms remain simple, their analysis is much more complex and often requires a completely different approach than the non-adversarial setting.