Spy vs Spy: Anonymous Messaging
summary
Claim: replacing random diffusion with a sampled-control spreading rule yields dramatically better source hiding. Using an adaptive diffusion protocol inspired by Polya’s urn (Chinese restaurant) and simple per-hop delays, detection probability drops from about 1/√n for standard diffusion to roughly 1/n on lines and regular trees. Threat model includes colluding spies with partial timing; theory and simulations back the theorem, and a prototype messaging app and lightweight crypto are feasible but not fully deployed.
AI-written summary · about
chapters (5)
- 0:00Start
- 4:59Distributed Messaging
- 5:29What Can an Adversary Do
- 7:14Diffusion Model
- 16:05Adaptive Diffusion
related talks
37mShort Industry Talks pt.2
38mHiding A Secret Distributed Chat System In 802.11 Management Frames
28mPaying for Privacy Preserving Messaging
25mDefeating Spy Nodes on the Monero Network
14mPractical Attacks on a Decentralized Secure Messenger Session
52mMechanisms for Honest Data Sharing under Competition
35mTrying to De-Anonymize I2P Network Participants
17mDefeating Slow-and-Low Threats via Diffusion Model-based Generative Inference