Technical Program

Paper Detail

Paper Title Embedding Covert Information on a Given Broadcast Code
Paper IdentifierTH3.R5.2
Authors David Kibloff, Samir Medina Perlaza, INRIA, France; Ligong Wang, CNRS, France
Session Secure and Covert Communication
Location Saint Victor, Level 3
Session Time Thursday, 11 July, 14:30 - 16:10
Presentation Time Thursday, 11 July, 14:50 - 15:10
Manuscript  Click here to download the manuscript
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 fol- lowing 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.