是谁散布的谣言？量化流言协议的自然差分隐私保证
Who started this rumor? Quantifying the natural differential privacy guarantees of gossip protocols
摘要：
Gossip协议被广泛用于大规模对等网络中的信息传播。这些协议通常声称可以保证隐私，因为它们在开始传播的节点上引入了不确定性。但这种说法真的是真的吗？八卦的源头能安全地隐藏在人群中吗？本文研究，第一次，八卦协议，通过严格的数学框架的基础上差分隐私，以确定在何种程度上的八卦来源可以追溯。考虑到一个完整的图中的一个子集的节点是好奇的情况下，我们研究了一个家庭的八卦协议参数化的“突变”参数$s$：节点停止发射后，以固定的概率$1-s$每次通信。我们首先证明了标准的推协议，对应的情况下$s=1$，不满足大型图的差分隐私。相比之下，协议与$s=0$实现了最佳的隐私保证，但在传播时间急剧增加的成本相比，标准的推，揭示了一个有趣的紧张局势之间的隐私和传播时间。然而，令人惊讶的是，我们表明，一些选择的静音参数$s$导致协议，实现最佳数量级的隐私和速度。我们还证实经验，适当的选择$s$，我们确实获得协议，是非常强大的对具体的源位置攻击，同时传播的信息几乎一样快的标准（和非私人）推协议。
英文摘要：
Gossip protocols are widely used to disseminate information in massive peer-to-peer 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 $1-s$. 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$ 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. We also confirm empirically that, with appropriate choices of $s$, we indeed obtain protocols that are very robust against concrete source location attacks while spreading the information almost as fast as the standard (and non-private) push protocol.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
