Article Dans Une Revue IEEE Transactions on Information Theory Année : 2024

Covert Communication Over Additive-Noise Channels

Résumé

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.
Fichier sous embargo
Fichier sous embargo
0 5 5
Année Mois Jours
Avant la publication
lundi 30 juin 2025
Fichier sous embargo
lundi 30 juin 2025
Connectez-vous pour demander l'accès au fichier

Dates et versions

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

Licence

Identifiants

Citer

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⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More