Who started this rumor? Quantifying the natural differential privacy of gossip protocols
From MaRDI portal
Publication:6535005
DOI10.4230/lipics.disc.2020.8zbMath1543.68108MaRDI QIDQ6535005
Hadrien Hendrikx, Aurélien Bellet, Rachid Guerraoui
Publication date: 2 November 2023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shortest-path problem for graphs with random arc-lengths
- How to discreetly spread a rumor in a crowd
- Privacy-conscious information diffusion in social networks
- On location hiding in distributed systems
- Distributed differential privacy via shuffling
- The privacy blanket of the shuffle model
- Fast computation by population protocols with a leader
- The Mathematics of Infectious Diseases
- The Algorithmic Foundations of Differential Privacy
- Gossiping With Multiple Messages
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
- Efficient Information Exchange in the Random Phone-Call Model
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On Spreading a Rumor
- Hiding the Rumor Source
- Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
- Rumors in a Network: Who's the Culprit?
- On the Push&Pull Protocol for Rumor Spreading
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Asynchronous gossip
- Social networks spread rumors in sublogarithmic time
This page was built for publication: Who started this rumor? Quantifying the natural differential privacy of gossip protocols