Perfectly Covert Communication Assisted by an Intelligent Reflecting Surface
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917300718796800 |
|---|---|
| author | Elimelech, Or Cohen, Asaf |
| author_facet | Elimelech, Or Cohen, Asaf |
| contents | 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 $1$ 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 feasible, perfectly covert configuration whenever one exists.
Finally, to address physical limitations, such as imperfect CSI, we introduce the notion of \emph{operational perfect covertness}. In this setting, we assume a bounded CSI error model and an analogous constraint on Willie. We derive robust conditions guaranteeing that the warden's detection capability remains effectively nullified even when exact signal cancellation is infeasible. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_09049 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Perfectly Covert Communication Assisted by an Intelligent Reflecting Surface Elimelech, Or Cohen, Asaf Information Theory Cryptography and Security 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 $1$ 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 feasible, perfectly covert configuration whenever one exists. Finally, to address physical limitations, such as imperfect CSI, we introduce the notion of \emph{operational perfect covertness}. In this setting, we assume a bounded CSI error model and an analogous constraint on Willie. We derive robust conditions guaranteeing that the warden's detection capability remains effectively nullified even when exact signal cancellation is infeasible. |
| title | Perfectly Covert Communication Assisted by an Intelligent Reflecting Surface |
| topic | Information Theory Cryptography and Security |
| url | https://arxiv.org/abs/2212.09049 |