Key and Message Semantic-Security Over State-Dependent Channels

We study the trade-off between secret message (SM) and secret key (SK) rates, simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes other instances of CSI availability as special cases, and calls for efficient utilization of the state sequence for both reliability and security purposes. An inner bound on the semantic-security (SS) SM-SK capacity region is derived based on a superposition coding scheme inspired by a past work of the authors. The region is shown to attain capacity for a certain class of SD-WTCs. SS is established by virtue of two versions of the strong soft-covering lemma. The derived region yields an improvement upon the previously best known SM-SK trade-off result reported by Prabhakaran et al., and, to the best of our knowledge, upon all other existing lower bounds for either SM or SK for this setup, even if the semantic security requirement is relaxed to weak secrecy. It is demonstrated that our region can be strictly larger than those reported in the preceding works.

[1]  Syed Ali Jafar.  Capacity With Causal and Noncausal Side Information: A Unified View , 2006, IEEE Transactions on Information Theory.

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

[3]  Aaron D. Wyner,et al.  Channels with Side Information at the Transmitter , 1993 .

[4]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[5]  Haim H. Permuter,et al.  Arbitrarily Varying Wiretap Channels with Type Constrained States , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[6]  A. J. Han Vinck,et al.  Wiretap Channel With Side Information , 2006, IEEE Transactions on Information Theory.

[7]  Ali Zibaeenejad.  Key Generation Over Wiretap Models With Non-Causal Side Information , 2015, IEEE Transactions on Information Forensics and Security.

[8]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[9]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[10]  Vinod M. Prabhakaran,et al.  Secrecy via Sources and Channels , 2008, IEEE Transactions on Information Theory.

[11]  Yuhong Yang.  Elements of Information Theory (2nd ed.). Thomas M. Cover and Joy A. Thomas , 2008 .

[12]  Xiaohu Tang,et al.  Wiretap Channel with Action-Dependent Channel State Information , 2013, Entropy.

[13]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[14]  Wei Liu,et al.  Wiretap Channel With Two-Sided Channel State Information , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[15]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[16]  Hsiao-Hwa Chen,et al.  Physical Layer Security for Next Generation Wireless Networks: Theories, Technologies, and Challenges , 2017, IEEE Communications Surveys & Tutorials.

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

[18]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[19]  Suhas N. Diggavi,et al.  Secret-Key Agreement With Channel State Information at the Transmitter , 2010, IEEE Transactions on Information Forensics and Security.

[20]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[21]  Shlomo Shamai,et al.  Secret key generation over noisy channels with common randomness , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[22]  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).

[23]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[24]  Neri Merhav,et al.  Exact Random Coding Secrecy Exponents for the Wiretap Channel , 2017, IEEE Trans. Inf. Theory.

[25]  Alexander Vardy,et al.  A Cryptographic Treatment of the Wiretap Channel , 2012, IACR Cryptol. ePrint Arch..

[26]  Paul W. Cuff,et al.  Exact Soft-Covering Exponent , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[27]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[28]  Aaron D. Wyner,et al.  The common information of two dependent random variables , 1975, IEEE Trans. Inf. Theory.

[29]  I. Csiszár,et al.  Common randomness and secret key generation with a helper , 1997, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

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

[31]  Gerhard Kramer,et al.  Informational divergence approximations to product distributions , 2013, 2013 13th Canadian Workshop on Information Theory.

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

[33]  Kai Zeng,et al.  Physical layer key generation in wireless networks: challenges and opportunities , 2015, IEEE Communications Magazine.

[34]  Shlomo Shamai,et al.  Semantically-Secured Message-Key Trade-off over Wiretap Channels with Random Parameters , 2017, ArXiv.

[35]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.

[36]  Suhas N. Diggavi,et al.  Secret-Key Generation Using Correlated Sources and Channels , 2009, IEEE Transactions on Information Theory.