Covert Communication over Noisy Channels: A Resolvability Perspective

Abstract

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that, irrespective of the quality of the channels, it is possible to communicate on the order of $\sqrt{n}$ reliable and covert bits over $n$ channel uses if the transmitter and the receiver share on the order of $\sqrt{n}$ key bits; this improves upon earlier results requiring on the order of $\sqrt{n}\log n$ key bits. Second, it proves that, if the receiver's channel is "better" than the warden's channel in a sense that we make precise, it is possible to communicate on the order of $\sqrt{n}$ reliable and covert bits over $n$ channel uses without a secret key; this generalizes earlier results established for binary symmetric channels. We also identify the fundamental limits of covert and secret communications in terms of the optimal asymptotic scaling of the message size and key size, and we extend the analysis to Gaussian channels. The main technical problem that we address is how to develop concentration inequalities for "low-weight" sequences; the crux of our approach is to define suitably modified typical sets that are amenable to concentration inequalities.

30 pages, 4 figures, accepted to IEEE Transactions on Information Theory

Cited by in corpus (58)

• Fundamental Limits of Communication with Low Probability of Detection
• Covert Wireless Communication with Artificial Noise Generation
• Gaussian Signalling for Covert Communications
• Aerial Intelligent Reflecting Surface Enabled Terahertz Covert Communications in Beyond-5G Internet of Things
• First and Second Order Asymptotics in Covert Communication
• Covert Transmission with a Self-sustained Relay
• Achieving Positive Covert Capacity over MIMO AWGN Channels
• 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
• How to Make 5G Communications "Invisible": Adversarial Machine Learning for Wireless Privacy
• A New Parallel Message-distribution Technique for Cost-based Steganography
• Covert Wireless Communications with Channel Inversion Power Control in Rayleigh Fading
• Information-Theoretic Security or Covert Communication
• Low Probability of Detection Communication: Opportunities and Challenges
• The Sound and the Fury: Hiding Communications in Noisy Wireless Networks with Interference Uncertainty
• Optimal Throughput for Covert Communication Over a Classical-Quantum Channel
• Wireless Covert Communications Aided by Distributed Cooperative Jamming over Slow Fading Channels
• Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices
• Covert Communication in Wireless Relay Networks
• Covert Wireless Communications with Active Eavesdropper on AWGN Channels
• Covert Communication Using Null Space and 3D Beamforming
• Hiding Information in Noise: Fundamental Limits of Covert Wireless Communication
• Covert Wireless Communications under Quasi-Static Fading with Channel Uncertainty
• Covert Communication Over a Compound Channel
• Computationally Efficient Covert Communication
• Embedding Covert Information in Broadcast Communications
• Covert Communication with Finite Blocklength in AWGN Channels
• Time-Division is Optimal for Covert Communication over Some Broadcast Channels
• Distributed Quantum Hypothesis Testing under Zero-rate Communication Constraints
• Total Variation Distance Based Performance Analysis of Covert Communication over AWGN Channels in Non-asymptotic Regime
• Challenges in Covert Wireless Communications with Active Warden on AWGN channels
• Robust Beamforming Design for Covert Communications
• Covert Beamforming Design for Intelligent Reflecting Surface Assisted IoT Networks
• Bounds on Covert Capacity with Sub-Exponential Random Slot Selection
• UAV-Enabled Cooperative Jamming for Covert Communications
• Asymptotic Coupling and Its Applications in Information Theory
• Achieving Covert Wireless Communications Using a Full-Duplex Receiver
• LPD Communication: A Sequential Change-Point Detection Perspective
• Covert Communication over Adversarially Jammed Channels
• Stealthy Communication over Adversarially Jammed Multipath Networks
• Optimal Change-Point Detection with Training Sequences in the Large and Moderate Deviations Regimes
• Treating Interference as Noise is Optimal for Covert Communication over Interference Channels
• Covert Communications with A Full-Duplex Receiver over Wireless Fading Channels
• Covert Identification over Binary-Input Discrete Memoryless Channels
• Chernoff Information Bottleneck for Covert Quantum Target Sensing
• Covert Communication over Two Types of Additive Noise Channels
• Jamming Aided Covert Communication with Multiple Receivers
• Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks
• Hiding Communications in AWGN Channels and THz Band with Interference Uncertainty
• Straggling for Covert Message Passing on Complete Graphs
• Undetectable Radios: Covert Communication under Spectral Mask Constraints
• Multi-Antenna Covert Communications in Random Wireless Networks
• Throughput Scaling of Covert Communication over Wireless Adhoc Networks
• Fundamental Limits of Covert Bit Insertion in Packets