Stealthy Communication over Adversarially Jammed Multipath Networks

TL;DR

This paper investigates how to enable covert and reliable communication over a multipath network despite active adversaries capable of jamming and eavesdropping, providing bounds on the maximum achievable stealthy data rates.

Contribution

It introduces new bounds on the capacity for stealthy communication in the presence of active jamming, addressing both erasure and overwrite attack models.

Findings

Inner bounds on stealthy capacities established

Effective strategies for covert communication under jamming

Analysis applicable to multiple jamming scenarios

Abstract

We consider the problem of stealthy communication over a multipath network in the presence of an active adversary. The multipath network consists of multiple parallel noiseless links, and the adversary is able to eavesdrop and jam a subset of links. We consider two types of jamming---erasure jamming and overwrite jamming. We require the communication to be both stealthy and reliable, i.e., the adversary should be unable to detect whether or not meaningful communication is taking place, while the legitimate receiver should reconstruct any potential messages from the transmitter with high probability simultaneously. We provide inner bounds on the stealthy capacities under both adversarial erasure and adversarial overwrite jamming.