A channel resolvability perspective on stealth communications

We analyze the problem of stealth communication and low probability of detection from the perspective of channel resolvability. We show that stealth communication over discrete memoryless channels and additive white Gaussian noise channels is possible without secret key as soon as the legitimate receiver´s channel is “better” than the warden´s channel, which generalizes previously known results to a much larger class of channels. The underlying technical problem that we solve is how to develop concentration inequalities for “low weight” sequences; the crux of our approach is to define modified “typical sets” that are amenable to concentration inequalities.