Keyless Covert Communication in the Presence of Non-causal Channel State Information

We consider the problem of covert communication over a state-dependent channel, for which the transmitter and the legitimate receiver have non-causal access to the channel state information. Covert communication with respect to an adversary, referred to as the “warden,” is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an inactive channel-input symbol. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver the codebook uncertainty is removed via a shared secret key that is unavailable to the warden. Unlike earlier work in state-dependent covert communication, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Rather, a shared randomness is extracted at the transmitter and the receiver from the channel state, in a manner that keeps the shared randomness secret from the warden despite the influence of the channel state on the warden’s output. An inner bound on the covert capacity, in the absence of an externally provided secret key, is derived.

[1]  Eduard A. Jorswieck,et al.  Stealthy keyless secret key generation from degraded sources , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[2]  Suhas N. Diggavi,et al.  Secret key agreement using asymmetry in channel state knowledge , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  Gregory W. Wornell,et al.  Covert Communication With Channel-State Information at the Transmitter , 2017, IEEE Transactions on Information Forensics and Security.

[4]  Haim H. Permuter,et al.  Wiretap channels with random states non-causally available at the encoder , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[5]  Lizhong Zheng,et al.  Fundamental Limits of Communication With Low Probability of Detection , 2015, IEEE Transactions on Information Theory.

[6]  Ghosheh Abed Hodtani,et al.  Wiretap channel with strictly causal side information at encoder , 2014, 2014 Iran Workshop on Communication and Information Theory (IWCIT).

[7]  Stephen E. Fienberg,et al.  Testing Statistical Hypotheses , 2005 .

[8]  Bin Dai,et al.  Wiretap Channel With Side Information , 2006, ArXiv.

[9]  Eduard A. Jorswieck,et al.  Stealthy Secret Key Generation , 2017, 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[10]  Boulat A. Bash,et al.  Limits of Reliable Communication with Low Probability of Detection on AWGN Channels , 2012, IEEE Journal on Selected Areas in Communications.

[11]  H. Vincent Poor,et al.  The Likelihood Encoder for Lossy Compression , 2014, IEEE Transactions on Information Theory.

[12]  Matthieu R. Bloch,et al.  Covert secret key generation , 2017, 2017 IEEE Conference on Communications and Network Security (CNS).

[13]  Sergio Verdú,et al.  $f$ -Divergence Inequalities , 2015, IEEE Transactions on Information Theory.

[14]  Abbas El Gamal,et al.  Wiretap Channel With Causal State Information , 2012, IEEE Transactions on Information Theory.

[15]  Matthieu R. Bloch,et al.  Covert Communication Over Noisy Channels: A Resolvability Perspective , 2015, IEEE Transactions on Information Theory.

[16]  Masahide Sasaki,et al.  Wiretap Channels With Causal State Information: Strong Secrecy , 2019, IEEE Transactions on Information Theory.

[17]  Hachiro Fujita.  On the Secrecy Capacity of Wiretap Channels With Side Information at the Transmitter , 2016, IEEE Transactions on Information Forensics and Security.

[18]  Mayank Bakshi,et al.  Reliable deniable communication: Hiding messages in noise , 2013, 2013 IEEE International Symposium on Information Theory.