Embedding Covert Information on a Given Broadcast Code

David Kibloff 1 Samir Perlaza 1 Ligong Wang 2
1 MARACAS - Modèle et algorithmes pour des systèmes de communication fiables
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : Given a code used to send a message to two receivers through a degraded discrete memoryless broadcast channel (DM-BC), the sender wishes to alter the codewords to achieve the following goals: (i) the original broadcast communication continues to take place, possibly at the expense of a tolerable increase of the decoding error probability; and (ii) an additional covert message can be transmitted to the stronger receiver such that the weaker receiver cannot detect the existence of this message. The main results are: (a) feasibility of covert communications is proven by using a random coding argument for general DM-BCs; and (b) necessary conditions for establishing covert communications are described and an impossibility (converse) result is presented for a particular class of DM-BCs. Together, these results characterize the asymptotic fundamental limits of covert communications for this particular class of DM-BCs within an arbitrarily small gap.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

Contributor : Kibloff David <>
Submitted on : Tuesday, May 21, 2019 - 3:52:13 PM
Last modification on : Thursday, May 23, 2019 - 11:19:41 AM


Files produced by the author(s)


  • HAL Id : hal-02135854, version 1


David Kibloff, Samir Perlaza, Ligong Wang. Embedding Covert Information on a Given Broadcast Code. ISIT 2019 - IEEE International Symposium on Information Theory, Jul 2019, Paris, France. pp.1-5. ⟨hal-02135854⟩



Record views


Files downloads