Journal Articles IEEE Transactions on Information Theory Year : 2024

Covert Communication Over Additive-Noise Channels

Abstract

We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild integrability assumptions, we find a general upper bound on the square-root scaling constant, which only involves the variance of the logarithm of the probability density function of the noise. Furthermore, we show that, under some additional assumptions, this upper bound is tight. We also provide upper bounds on the length of the secret key required to achieve the optimal scaling.
Embargoed file
Embargoed file
0 4 20
Year Month Jours
Avant la publication
Monday, June 30, 2025
Embargoed file
Monday, June 30, 2025
Please log in to request access to the document

Dates and versions

hal-04856965 , version 1 (27-12-2024)

Licence

Identifiers

Cite

Cécile Bouette, Laura Luzzi, Ligong Wang. Covert Communication Over Additive-Noise Channels. IEEE Transactions on Information Theory, 2024, ⟨10.1109/TIT.2024.3522151⟩. ⟨hal-04856965⟩
9 View
0 Download

Altmetric

Share

More