Cooperative Resolvability and Secrecy in the Cribbing Multiple-Access Channel

We study channel resolvability for the discrete memoryless multiple-access channel with cribbing, i.e., the characterization of the amount of randomness required at the inputs to approximately produce a chosen i.i.d. output distribution according to Kullback-Leibler divergence. We analyze resolvability rates when one encoder cribs (i) the input of the other encoder; or the output of the other encoder, (ii) non-causally, (iii) causally, or (iv) strictly-causally. For scenarios (i)-(iii), we exactly characterize the channel resolvability region. For (iv), we provide inner and outer bounds for the channel resolvability region; the crux of our achievability result is to handle the strict causality constraint with a block-Markov coding scheme in which dependencies across blocks are suitably hidden. Finally, we leverage the channel resolvability results to derive achievable secrecy rate regions for each of the cribbing scenarios under strong secrecy constraints.

[1]  Shraga I. Bross.  The Discrete Memoryless Interference Channel With One-Sided Generalized Feedback and Secrecy , 2010, IEEE Transactions on Information Theory.

[2]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

[3]  Sergio Verdú,et al.  Resolvability in Eγ with applications to lossy compression and wiretap channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[4]  Sergio Verdú,et al.  Simulation of random processes and rate-distortion theory , 1996, IEEE Trans. Inf. Theory.

[5]  Matthieu R. Bloch,et al.  Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.

[6]  Remi A. Chou,et al.  Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[7]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[8]  Luc Vandendorpe,et al.  Multiaccess Channel With Partially Cooperating Encoders and Security Constraints , 2012, IEEE Transactions on Information Forensics and Security.

[9]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

[10]  Elza Erkip,et al.  The Relay Channel with a Wire-tapper , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

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

[12]  Slawomir Stanczak,et al.  The MAC Resolvability Region, Semantic Security and Its Operational Implications , 2017, ArXiv.

[13]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[14]  Jörg Kliewer,et al.  Strong coordination over a line network , 2013, 2013 IEEE International Symposium on Information Theory.

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

[16]  Mohammad Reza Aref,et al.  Multiple Access Wiretap channels with strong secrecy , 2010, 2010 IEEE Information Theory Workshop.

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

[18]  Zhiguo Ding,et al.  Rate Regions for Multiple Access Channel With Conference and Secrecy Constraints , 2013, IEEE Transactions on Information Forensics and Security.

[19]  Haim H. Permuter,et al.  Strong Secrecy for Cooperative Broadcast Channels , 2016, IEEE Transactions on Information Theory.

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

[21]  Reza Khosravi-Farsani,et al.  Capacity theorems for the Cognitive Radio Channel with confidential messages , 2014, 2014 IEEE International Symposium on Information Theory.

[22]  Haim Permuter,et al.  Multiple-Access Channel With Partial and Controlled Cribbing Encoders , 2013, IEEE Transactions on Information Theory.

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

[24]  Osvaldo Simeone,et al.  The Cognitive Multiple Access Wire-Tap Channel , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[25]  Paul W. Cuff,et al.  Distributed Channel Synthesis , 2012, IEEE Transactions on Information Theory.

[26]  Alexandre J. Pierrot,et al.  Strongly Secure Communications Over the Two-Way Wiretap Channel , 2010, IEEE Transactions on Information Forensics and Security.

[27]  Yossef Steinberg.  Resolvability Theory for the Multiple-Access Channel , 1998, IEEE Trans. Inf. Theory.

[28]  Ming Xiao,et al.  Strong Secrecy for Interference Channels Based on Channel Resolvability , 2018, IEEE Transactions on Information Theory.

[29]  H. Vincent Poor,et al.  Multiple Access Channels with Generalized Feedback and Confidential Messages , 2007, 2007 IEEE Information Theory Workshop.

[30]  Shlomo Shamai,et al.  Capacity of Cognitive Interference Channels With and Without Secrecy , 2009, IEEE Transactions on Information Theory.

[31]  Shun Watanabe,et al.  Cognitive Interference Channels With Confidential Messages Under Randomness Constraint , 2014, IEEE Transactions on Information Theory.

[32]  Sennur Ulukus,et al.  Secrecy in Cooperative Relay Broadcast Channels , 2008, IEEE Transactions on Information Theory.

[33]  Masahito Hayashi,et al.  General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel , 2006, IEEE Transactions on Information Theory.

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

[35]  Sergio Verdú,et al.  Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.