Abstract
Gossip protocols (also called rumor spreading or epidemic protocols) are widely used to disseminate information in massive peertopeer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node that started the dissemination. But is that claim really true? Can the source of a gossip safely hide in the crowd? This paper examines, for the first time, gossip protocols through a rigorous mathematical framework based on differential privacy to determine the extent to which the source of a gossip can be traceable. Considering the case of a complete graph in which a subset of the nodes are curious, we study a family of gossip protocols parameterized by a "muting" parameter s: nodes stop emitting after each communication with a fixed probability 1s. We first prove that the standard push protocol, corresponding to the case s = 1, does not satisfy differential privacy for large graphs. In contrast, the protocol with s = 0 (nodes forward only once) achieves optimal privacy guarantees but at the cost of a drastic increase in the spreading time compared to standard push, revealing an interesting tension between privacy and spreading time. Yet, surprisingly, we show that some choices of the muting parameter s lead to protocols that achieve an optimal order of magnitude in both privacy and speed. Privacy guarantees are obtained by showing that only a small fraction of the possible observations by curious nodes have different probabilities when two different nodes start the gossip, since the source node rapidly stops emitting when s is small. The speed is established by analyzing the mean dynamics of the protocol, and leveraging concentration inequalities to bound the deviations from this mean behavior. We also confirm empirically that, with appropriate choices of s, we indeed obtain protocols that are very robust against concrete source location attacks (such as maximum a posteriori estimates) while spreading the information almost as fast as the standard (and nonprivate) push protocol.
BibTeX  Entry
@InProceedings{bellet_et_al:LIPIcs:2020:13086,
author = {Aur{\'e}lien Bellet and Rachid Guerraoui and Hadrien Hendrikx},
title = {{Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols}},
booktitle = {34th International Symposium on Distributed Computing (DISC 2020)},
pages = {8:18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771689},
ISSN = {18688969},
year = {2020},
volume = {179},
editor = {Hagit Attiya},
publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13086},
URN = {urn:nbn:de:0030drops130868},
doi = {10.4230/LIPIcs.DISC.2020.8},
annote = {Keywords: Gossip Protocol, Rumor Spreading, Differential Privacy}
}
Keywords: 

Gossip Protocol, Rumor Spreading, Differential Privacy 
Collection: 

34th International Symposium on Distributed Computing (DISC 2020) 
Issue Date: 

2020 
Date of publication: 

07.10.2020 