Zachary Ratliff (Harvard University), Ruoxing (David) Yang (Georgetown University), Avery Bai (Georgetown University), Harel Berger (Ariel University), Micah Sherr (Georgetown University), James Mickens (Harvard University)

In authoritarian and highly surveilled environments, traditional communication networks are vulnerable to censorship, monitoring, and disruption. While decentralized anonymity networks such as Tor provide strong privacy guarantees, they remain dependent on centralized Internet infrastructure, making them susceptible to large-scale blocking or shutdowns. To address these limitations, we present MIRAGE, a privacy-preserving mobility-based messaging system designed for censorship-resistant communication. MIRAGE uses a district-based routing scheme that probabilistically forwards messages based on the high-level mobility patterns of the population. To prevent leakage of individual mobility behavior, MIRAGE protects users’ mobility patterns with local differential privacy, ensuring that participation in the network does not reveal an individual’s location history through observable routing decisions.

We implement MIRAGE within Cadence, an open-source simulator that provides a unified framework for evaluating mobility-based protocols using approximated geographical encounters between nodes over time. We analyze the privacy and efficiency tradeoffs of MIRAGE and evaluate its performance against (1) traditional epidemic and random-walk-based routing protocols and (2) the state-of-the-art privacy-preserving geography-based routing protocol, using real-world trajectories—one from pedestrian movement patterns collected in various urban locations and another consisting of GPS traces from taxi operations. Our results demonstrate that MIRAGE significantly reduces message overhead compared to epidemic routing, and outperforms probabilistic flooding in terms of delivery rate, while providing stronger privacy guarantees than existing techniques.

View More Papers

Cache Me, Catch You: Cache Related Security Threats in...

XiangFan Wu (Ocean University of China; QI-ANXIN Technology Research Institute), Lingyun Ying (QI-ANXIN Technology Research Institute), Guoqiang Chen (QI-ANXIN Technology Research Institute), Yacong Gu (Tsinghua University; Tsinghua University-QI-ANXIN Group JCNS), Haipeng Qu (Department of Computer Science and Technology, Ocean University of China)

Read More

Breaking the Generative Steganography Trilemma: ANStega for Optimal Capacity,...

Yaofei Wang (Hefei University of Technology), Weilong Pang (Hefei University of Technology), Kejiang Chen (University of Science and Technology of China), Jinyang Ding (University of Science and Technology of China), Donghui Hu (Hefei University of Technology), Weiming Zhang (University of Science and Technology of China), Nenghai Yu (University of Science and Technology of China)

Read More

“I found the text to be encouraging” – Evaluating...

Rozalina Doneva (Karlsruhe Institute of Technology (KIT)), Anne Hennig (Karlsruhe Institute of Technology (KIT)), Peter Mayer (University of Southern Denmark (SDU))

Read More