Anonymous Stochastic Routing
From MaRDI portal
Publication:5084500
Abstract: We propose and analyze a recipient-anonymous stochastic routing model to study a fundamental trade-off between anonymity and routing delay. An agent wants to quickly reach a goal vertex in a network through a sequence of routing actions, while an overseeing adversary observes the agent's entire trajectory and tries to identify her goal among those vertices traversed. We are interested in understanding the probability that the adversary can correctly identify the agent's goal (anonymity), as a function of the time it takes the agent to reach it (delay). A key feature of our model is the presence of intrinsic uncertainty in the environment, so that each of the agent's intended steps is subject to random perturbation and thus may not materialize as planned. Using large-network asymptotics, our main results provide near-optimal characterization of the anonymity-delay trade-off under a number of network topologies. Our main technical contributions are centered around a new class of "noise-harnessing" routing strategies that adaptively combine intrinsic uncertainty from the environment with additional artificial randomization to achieve provably efficient obfuscation.
Recommendations
- Finding routes in anonymous sensor networks
- Anti-localization anonymous routing for delay tolerant network
- Stochastic selfish routing
- Efficient bidirectional anonymous routing protocol for wireless ad hoc networks
- Stochastic Routing in Ad-Hoc Networks
- An anonymous routing scheme with forward secrecy for mobile ad hoc networks
Cites work
- A note on the stochastic shortest-route problem
- An Analysis of Stochastic Shortest Path Problems
- Delay-predictability trade-offs in reaching a secret goal
- Differential Privacy: A Survey of Results
- Infection Spreading and Source Identification: A Hide and Seek Game
- Perception games and privacy
- Privacy-Preserving Public Information for Sequential Games
- Robust adaptive routing under uncertainty
- Routing optimization under uncertainty
- The algorithmic foundations of differential privacy
- The empirical implications of privacy-aware choice
- To reveal or not to reveal: privacy preferences and economic frictions
Cited in
(7)- Anonymous Networking Amidst Eavesdroppers
- Anti-localization anonymous routing for delay tolerant network
- scientific article; zbMATH DE number 2112442 (Why is no real title available?)
- Delay-predictability trade-offs in reaching a secret goal
- A Model of Onion Routing with Provable Anonymity
- Non-interactive anonymous router
- The anonymous subgraph problem
This page was built for publication: Anonymous Stochastic Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084500)
