Who started this rumor? Quantifying the natural differential privacy of gossip protocols
type: Item
instance of: scholarly article
title: Who started this rumor? Quantifying the natural differential privacy of gossip protocols
zbMATH Open document ID: 1543.68108
author: Aurélien Bellet
author: Rachid Guerraoui
author: Hadrien Hendrikx
publication date: 2023-11-02T00:00:00Z
Mathematics Subject Classification ID: 68P27
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 7760497
zbMATH Keywords: gossip protocol
zbMATH Keywords: rumor spreading
zbMATH Keywords: differential privacy
MaRDI profile type: MaRDI publication profile
cites work: On the Push&Pull Protocol for Rumor Spreading
cites work: How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
cites work: Fast computation by population protocols with a leader
cites work: The privacy blanket of the shuffle model
cites work: Efficient Information Exchange in the Random Phone-Call Model
cites work: Q3546603
cites work: Q5396633
cites work: Distributed differential privacy via shuffling
cites work: Social networks spread rumors in sublogarithmic time
cites work: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
cites work: Our Data, Ourselves: Privacy Via Distributed Noise Generation
cites work: The Algorithmic Foundations of Differential Privacy
cites work: Q3285941
cites work: Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
cites work: Hiding the Rumor Source
cites work: The shortest-path problem for graphs with random arc-lengths
cites work: Asynchronous gossip
cites work: How to discreetly spread a rumor in a crowd
cites work: Privacy-conscious information diffusion in social networks
cites work: On location hiding in distributed systems
cites work: The mathematics of infectious diseases
cites work: On Spreading a Rumor
cites work: Gossiping With Multiple Messages
cites work: Rumors in a Network: Who's the Culprit?
Recommended article: Secure gossip against intermittently malicious agents
Recommended article: Q5015383
Recommended article: Epistemic protocols for dynamic gossip
Recommended article: Verifiable broadcasting and gossiping in communication networks
Recommended article: The Worst Case Behavior of Randomized Gossip
Recommended article: Tight bounds for quasirandom rumor spreading
Recommended article: Distributed Private Data Analysis
Recommended article: Eavesdropping games
Recommended article: Differential Privacy: A Survey of Results
Recommended article: Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
DOI: 10.4230/LIPICS.DISC.2020.8
description: scientific article; zbMATH DE number 7760497