Dependent link padding algorithms for low latency anonymity systems
Proceedings of the 15th ACM conference on Computer and communications security
IEEE Transactions on Wireless Communications
Maximum throughput of clandestine relay
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Towards a theory of anonymous networking
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the maximum throughput of clandestine sensor networking
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Anonymous networking amidst active adversaries
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Efficient web browsing with perfect anonymity using page prefetching
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
A game-theoretic approach to anonymous networking
IEEE/ACM Transactions on Networking (TON)
Security and privacy issues for the network of the future
Security and Communication Networks
A collaborative protocol for anonymous reporting in vehicular ad hoc networks
Computer Standards & Interfaces
Hi-index | 754.84 |
The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of ldquoanonymityrdquo of routes in eavesdropped networks is proposed using the information-theoretic equivocation. For a physical layer with orthogonal transmitter directed signaling, scheduling and relaying techniques are designed to maximize achievable network performance for any desired level of anonymity. The network performance is measured by the total rate of packets delivered from the sources to destinations under strict latency and medium access constraints. In particular, analytical results are presented for two scenarios: For a single relay that forwards packets from users, relaying strategies are provided that minimize the packet drops when the source nodes and the relay generate independent transmission schedules. A relay using such an independent scheduling strategy is undetectable by an eavesdropper and is referred to as a covert relay. Achievable rate regions are characterized under strict and average delay constraints on the traffic, when schedules are independent Poisson processes. For a multihop network with an arbitrary anonymity requirement, the problem of maximizing the sum-rate of flows (network throughput) is considered. A randomized selection strategy to choose covert relays as a function of the routes is designed for this purpose. Using the analytical results for a single covert relay, the strategy is optimized to obtain the maximum achievable throughput as a function of the desired level of anonymity. In particular, the throughput-anonymity relation for the proposed strategy is shown to be equivalent to an information-theoretic rate-distortion function.