Fundamental Limits of Communication with Low Probability of Detection

Abstract

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low. Specifically, the relative entropy between the output distributions when a codeword is transmitted and when no input is provided to the channel must be sufficiently small. For a DMC whose output distribution induced by the "off" input symbol is not a mixture of the output distributions induced by other input symbols, it is shown that the maximum amount of information that can be transmitted under this criterion scales like the square root of the blocklength. The same is true for the AWGN channel. Exact expressions for the scaling constant are also derived.

Version to appear in IEEE Transactions on Information Theory; minor typos in v2 corrected. Part of this work was presented at ISIT 2015 in Hong Kong

References in corpus (1)

• Covert Communication over Noisy Channels: A Resolvability Perspective

Cited by in corpus (13)

• Gaussian Signalling for Covert Communications
• First and Second Order Asymptotics in Covert Communication
• Covert Transmission with a Self-sustained Relay
• Achieving Positive Covert Capacity over MIMO AWGN Channels
• Two-way covert quantum communication in the microwave regime
• Covert Capacity of Bosonic Channels
• Covert MIMO Communications under Variational Distance Constraint
• A framework for covert and secret key expansion over quantum channels
• Covert Secret Key Generation with an Active Warden
• Covert sensing using floodlight illumination
• Secret key expansion from covert communication
• Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints
• Bounds on Covert Capacity with Sub-Exponential Random Slot Selection