Spy vs. Spy: Rumor Source Obfuscation

@article{Fanti2014SpyVS,
  title={Spy vs. Spy: Rumor Source Obfuscation},
  author={Giulia C. Fanti and Peter Kairouz and Sewoong Oh and Pramod Viswanath},
  journal={ArXiv},
  year={2014},
  volume={abs/1412.8439}
}
Anonymous messaging platforms, such as Secret, Yik Yak and Whisper, have emerged as important social media for sharing one's thoughts without the fear of being judged by friends, family, or the public. Further, such anonymous platforms are crucial in nations with authoritarian governments; the right to free expression and sometimes the personal safety of the author of the message depend on anonymity. Whether for fear of judgment or personal endangerment, it is crucial to keep anonymous the… 
Hiding the Rumor Source
TLDR
A novel messaging protocol is introduced, which is called adaptive diffusion, and it is shown that under the snapshot adversarial model, adaptive diffusion spreads content fast and achieves perfect obfuscation of the source when the underlying contact network is an infinite regular tree.
Metadata-Conscious Anonymous Messaging
TLDR
This work proves that the performance of a message propagation protocol called adaptive diffusion achieves asymptotically optimal source-hiding and significantly outperforms standard diffusion and demonstrates empirically that adaptive diffusion hides the source effectively on real social graphs.
Privacy-preserving Messaging and Search: A Collaborative Approach
TLDR
It is shown theoretically that adaptive diffusion gives optimal or asymptotically-optimal anonymity guarantees over certain classes of synthetic graphs for various adversarial models, while spreading nearly as fast as traditional symmetric mechanisms.
Rumor Source Detection With Multiple Observations Under Adaptive Diffusions
TLDR
It is shown that a weak form of source obfuscation is still possible in the case of two independent snapshots, but already with three observations there is a simple algorithm that finds the rumor source with constant probability, regardless of the adaptive diffusion protocol.
Rumor Source Obfuscation on Irregular Trees
TLDR
Results from numerical experiments suggest that PAAD achieves a lower probability of detection, at the cost of increased communication for coordination, which leads to a new family of protocols that are called Preferential Attachment Adaptive Diffusion (PAAD).
Dandelion: Redesigning the Bitcoin Network for Anonymity
TLDR
This work redesigns the P2P network from first principles with the goal of providing strong, provable anonymity guarantees, and proposes a simple networking policy called Dandelion, which achieves nearly-optimal anonymity guarantees at minimal cost to the network's utility.
Dandelion: Redesigning the Bitcoin Network for Anonymity
TLDR
In this context, egalitarianism means that no single party wields disproportionate power over the network's operation, and transparency means that all transactions are verified and recorded with cryptographic integrity guarantees; this prevents fraudulent activity like double-spending of money.
3P3: Strong Flexible Privacy for Broadcasts
  • David Mödinger, F. Hauck
  • Computer Science
    2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
  • 2020
TLDR
3P3 is presented, a three-phase privacy-preserving broadcast protocol that provides strong base privacy against global attackers and malicious nodes and additional privacy against common attackers, e.g., botnets.
Algorithmic advances in anonymous communication over networks
  • G. Fanti, P. Viswanath
  • Computer Science
    2016 Annual Conference on Information Science and Systems (CISS)
  • 2016
TLDR
Two guidelines are presented that suggest alternative research directions that exploit surveillance agencies' weaknesses at the physical layer, and consider the many weaker, but still relevant, adversaries who contribute to global censorship and surveillance.
Dandelion++: Lightweight Cryptocurrency Networking with Formal Anonymity Guarantees
TLDR
This work presents Dandelion++, a first-principles defense against large-scale deanonymization attacks with near-optimal information-theoretic guarantees, and evaluates it through experiments on Bitcoin's mainnet to demonstrate its interoperability and low broadcast latency overhead.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
Dissent: accountable anonymous group messaging
TLDR
The protocol preserves message integrity and one-to-one correspondence between members and messages, makes denial-of-service attacks by members traceable to the culprit, and efficiently handles large, unbalanced message loads.
k-anonymous message transmission
TLDR
This paper shows that there exist simple and efficient protocols which are k-anonymous for both the sender and the receiver in a model where a polynomial time adversary can see all traffic in the network and can control up to a constant fraction of the participants.
Privacy-preserving P2P data sharing with OneSwarm
TLDR
This paper describes the design and implementation of a new P2P data sharing protocol, called OneSwarm, that provides users much better privacy than BitTorrent and much better performance than Tor or Freenet.
Dining Cryptographers Revisited
Dining cryptographers networks (or DC-nets) are a privacy-preserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic DC-net is its
Herbivore: A Scalable and Efficient Protocol for Anonymous Communication
TLDR
Herbivore is described, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity and privacy and simultaneously provides high efficiency and scalability, distinguishing it from other anonymous communication protocols.
Tarzan: a peer-to-peer anonymizing network layer
TLDR
Measurements show that Tarzan imposes minimal overhead over a corresponding non-anonymous overlay route, and Protocols toward unbiased peer-selection offer new directions for distributing trust among untrusted entities.
Rumors in a Network: Who's the Culprit?
TLDR
Simulations show that rumor centrality outperforms distance centrality in finding rumor sources in networks which are not tree-like, and it is proved that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ.
Rumor source detection with multiple observations: fundamental limits and algorithms
TLDR
Surprisingly, even with merely two observations, the detection probability at least doubles that of a single observation, and further approaches one, i.e., reliable detection, with increasing degree, indicates that a richer diversity enhances detectability.
Rumor centrality: a universal source detector
TLDR
A variety of results are obtained establishing the universality of rumor centrality in the context of tree-like graphs and the SI model with a generic spreading time distribution and an interesting connection between a multi-type continuous time branching process and the effectiveness of rumors centrality is made.
The dining cryptographers problem: Unconditional sender and recipient untraceability
  • D. Chaum
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2004
TLDR
The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively, and can be adapted to address efficiently a wide variety of practical considerations.
...
1
2
3
...