TY - JOUR
T1 - Strong Secrecy for Interference Channels Based on Channel Resolvability
AU - Wang, Zhao
AU - Schaefer, Rafael F.
AU - Skoglund, Mikael
AU - Xiao, Ming
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received May 21, 2015; revised February 26, 2018; accepted April 21, 2018. Date of publication May 9, 2018; date of current version June 20, 2018. This work was supported by the U.S. National Science Foundation under Grants CNS-1702808 and ECCS-1647198.
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2018/7
Y1 - 2018/7
N2 - Interference channels with confidential messages are studied under strong secrecy constraints, based on the framework of channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. The information-spectrum method introduced by Han and Verdú is generalized to an arbitrary interference channel to obtain a direct channel resolvability result as a first step. For stationary and memoryless channels with discrete output alphabets, the results show that the achievable rates under weak and strong secrecy constraints are the same. This result is then generalized to channels with continuous output alphabets by deriving a reverse direction of Pinsker's inequality to bound the secrecy measure from above by a function of the variational distance of relevant distributions. As an application, Gaussian interference channels are studied in which the agreement between the best known weak and strong secrecy rate regions also appear. Following the footsteps of Csiszár, Hayashi and of Bloch and Laneman, these results provide further evidence that channel resolvability is a powerful and general framework for strong secrecy analysis in multiuser networks.
AB - Interference channels with confidential messages are studied under strong secrecy constraints, based on the framework of channel resolvability theory. It is shown that if the random binning rate for securing a confidential message is above the resolution of its corresponding wiretapped channel, strong secrecy can be guaranteed. The information-spectrum method introduced by Han and Verdú is generalized to an arbitrary interference channel to obtain a direct channel resolvability result as a first step. For stationary and memoryless channels with discrete output alphabets, the results show that the achievable rates under weak and strong secrecy constraints are the same. This result is then generalized to channels with continuous output alphabets by deriving a reverse direction of Pinsker's inequality to bound the secrecy measure from above by a function of the variational distance of relevant distributions. As an application, Gaussian interference channels are studied in which the agreement between the best known weak and strong secrecy rate regions also appear. Following the footsteps of Csiszár, Hayashi and of Bloch and Laneman, these results provide further evidence that channel resolvability is a powerful and general framework for strong secrecy analysis in multiuser networks.
KW - Strong secrecy
KW - channel resolvability
KW - interference channel
KW - reverse Pinsker's inequality
KW - variational distance
UR - http://www.scopus.com/inward/record.url?scp=85046818165&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046818165&partnerID=8YFLogxK
U2 - 10.1109/TIT.2018.2834508
DO - 10.1109/TIT.2018.2834508
M3 - Article
AN - SCOPUS:85046818165
SN - 0018-9448
VL - 64
SP - 5110
EP - 5130
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 7
ER -