Strong Secrecy for Interference Channels Based on Channel Resolvability
Strong Secrecy for Interference Channels Based on Channel Resolvability
复制标题
DOI：
10.1109/tit.2018.2834508
复制
发表时间：
2018-05
影响因子：
2.5
通讯作者：
Zhao Wang;Rafael F. Schaefer;M. Skoglund;Ming Xiao;H. V. Poor
中科院分区：
文献类型：
--
作者：
Zhao Wang;Rafael F. Schaefer;M. Skoglund;Ming Xiao;H. V. Poor
基于信道可分解性理论框架，研究了强保密约束条件下含保密消息的干扰信道。结果表明，如果用于确保机密消息的随机分箱率高于其相应的窃听信道的分辨率，则可以保证强保密性。Han和Verdú引入的信息谱方法被推广到任意干扰信道，以获得直接信道可分辨性结果作为第一步。结果表明，对于具有离散输出字母表的平稳无记忆信道，弱保密约束和强保密约束下的可达速率是相同的。这个结果，然后推广到连续输出字母的渠道，通过推导出一个相反方向的平斯克不等式约束的保密措施从上面的相关分布的变距离的函数。作为应用，研究了高斯干扰信道中最佳弱保密率区域和最佳强保密率区域之间的一致性。跟随Csiszár，Hayashi和Bloch和Laneman的脚步，这些结果进一步证明了信道可分解性是多用户网络中强保密性分析的一个强大而通用的框架。
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.