The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes place. A novel outer bound is proposed and, employing a previously reported inner bound, the secret key capacity is derived under certain less-noisy conditions on the channel or source components. This result improves upon the existing literature where the more stringent condition of degradedness is required. Furthermore, numerical evaluation of the achievable scheme and previously reported results for a binary model are presented; a comparison of the numerical bounds provides insights on the benefit of the chosen scheme.

[1]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2]  Imre Csiszár,et al.  Secrecy Capacities for Multiterminal Channel Models , 2005, IEEE Transactions on Information Theory.

[3]  Himanshu Tyagi,et al.  Secret Key Agreement: General Capacity and Second-Order Asymptotics , 2014, IEEE Transactions on Information Theory.

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

[5]  Imre Csiszár,et al.  Secrecy Generation for Multiaccess Channel Models , 2013, IEEE Transactions on Information Theory.

[6]  Camilla Hollanti,et al.  Physical Layer Security: A Paradigm Shift in Data Confidentiality , 2016 .

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

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

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

[10]  Pablo Piantanida,et al.  Secret Key Generation over Noisy Channels with Correlated Sources , 2018 .

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

[12]  Jun Muramatsu.  General formula for secrecy capacity of wiretap channel with noncausal state , 2014, 2014 IEEE International Symposium on Information Theory.

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

[14]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[15]  Chandra Nair.  Capacity regions of two new classes of 2-receiver broadcast channels , 2009, ISIT.

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

[17]  Shlomo Shamai,et al.  The wiretap channel with generalized feedback: Secure communication and key generation , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

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

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

[20]  Mikael Skoglund,et al.  Key Agreement over a Generalized Multiple Access Channel Using Noiseless and Noisy Feedback , 2013, IEEE Journal on Selected Areas in Communications.

[21]  Imre Csiszár,et al.  Common randomness and secret key generation with a helper , 2000, IEEE Trans. Inf. Theory.

[22]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part II: Channel Model , 2010, IEEE Transactions on Information Theory.

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

[24]  Haim H. Permuter,et al.  Key and Message Semantic-Security Over State-Dependent Channels , 2020, IEEE Transactions on Information Forensics and Security.

[25]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.

[26]  Thomas A. Courtade,et al.  Coded Cooperative Data Exchange for a Secret Key , 2014, IEEE Transactions on Information Theory.

[27]  H. Vincent Poor,et al.  On the Computability of the Secret Key Capacity under Rate Constraints , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[28]  Himanshu Tyagi,et al.  Multiterminal Secrecy by Public Discussion , 2016, Found. Trends Commun. Inf. Theory.

[29]  Marco Baldi,et al.  Physical and Data-Link Security Techniques for Future Communication Systems , 2016 .

[30]  Pablo Piantanida,et al.  The Gaussian wiretap channel with correlated sources at the terminals: Secret communication and key generation , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[31]  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.

[32]  Wei Kang,et al.  Secret key generation from correlated sources and secure link , 2017, 2017 9th International Conference on Wireless Communications and Signal Processing (WCSP).

[33]  Himanshu Tyagi,et al.  Common Information and Secret Key Capacity , 2013, IEEE Transactions on Information Theory.