Perfectly Covert Communication Assisted by an Intelligent Reflecting Surface
Or Elimelech, Asaf Cohen

TL;DR
This paper explores the fundamental limits and practical design of perfect covert communication using an Intelligent Reflecting Surface, providing analytical conditions, convergence guarantees, and robustness to physical imperfections.
Contribution
It characterizes conditions for perfect covertness, proves convergence of phase design algorithms, and introduces robust criteria under CSI errors for covert communication with IRS.
Findings
Probability of perfect covertness approaches 1 with more reflecting elements
Gradient descent reliably finds globally optimal phase configurations
Robust conditions ensure covertness despite CSI imperfections
Abstract
This work investigates the fundamental limits of \emph{perfect} covert communication assisted by an Intelligent Reflecting Surface (IRS). We first characterize the necessary and sufficient conditions for perfect covertness, defined as zero received energy at the warden (Willie), and provide a complete analytical solution for the two-element case. For general array sizes, we prove that the probability of achieving perfect covertness converges to almost surely as the number of reflecting elements increases. To enable practical implementation, we formulate the phase design problem as an interference-minimization problem. A key contribution is proving that the objective satisfies the \emph{strict-saddle} property. Consequently, we establish that gradient descent with random initialization converges almost surely to a global minimizer (zero interference), thereby identifying a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIntelligence, Security, War Strategy
