Adding a Helper Can Totally Remove the Secrecy Constraints in a Two-User Interference Channel

被引:11
|
作者
Chen, Jinyuan [1 ]
Li, Fan [1 ]
机构
[1] Louisiana Tech Univ, Dept Elect Engn, Ruston, LA 71272 USA
关键词
Information theoretic security; interference channel; generalized degrees-of-freedom; MULTIPLE-ACCESS CHANNELS; BROADCAST CHANNELS; SECURE DEGREES; WIRELESS NETWORKS; CAPACITY; FREEDOM; ALIGNMENT;
D O I
10.1109/TIFS.2019.2913514
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this paper, we show an interesting observation that adding a helper can totally remove the penalty in sum GDoF for a two-user symmetric Gaussian interference channel. For the interference channel where each transmitter sends a message to an intended receiver without secrecy constraints, the sum GDoF is a well-known "W" curve, characterized by Etkin-Tse-Wang in 2008. If the secrecy constraints are imposed on this interference channel, where the message of each transmitter must be secure from the unintended receiver (eavesdropper), then a GDoF penalty is incurred and the secure sum GDoF is reduced to a modified "W" curve, derived by Chen recently. In this paper, we show that, by adding a helper into this interference channel with secrecy constraints, the secure sum GDoF turns out to be a "W" curve, which is the same as the sum GDoF of the setting without secrecy constraints. The proposed scheme is based on the cooperative jamming and a careful signal design such that the jamming signal of the helper is aligned at a specific direction and power level with the information signals of the transmitters, which allows us to totally remove the penalty in GDoF due to the secrecy constraints. Furthermore, the estimation approaches of noise removal and signal separation due to the rational independence are used in the secure rate analysis.
引用
收藏
页码:3126 / 3139
页数:14
相关论文
共 50 条
  • [1] Limited Rate Feedback for Two-User MISO Gaussian Interference Channel With and Without Secrecy
    Yang, Xinjie
    Swindlehurst, A. Lee
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (18) : 4884 - 4897
  • [2] Adding Common Randomness Can Remove the Secrecy Penalty in GDoF
    Li, Fan
    Chen, Jinyuan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (04) : 2308 - 2333
  • [3] On the Capacity of the Two-User Symmetric Interference Channel With Transmitter Cooperation and Secrecy Constraints
    Mohapatra, Parthajit
    Murthy, Chandra R.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (10) : 5664 - 5689
  • [4] The Two-User Compound Interference Channel
    Raja, Adnan
    Prabhakaran, Vinod M.
    Viswanath, Pramod
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) : 5100 - 5120
  • [5] Ergodic secrecy rate of two-user MISO interference channels with statistical CSI
    Fei ZeSong
    Ni JiQing
    Zhao Di
    Xing ChengWen
    Wang NiWei
    Kuang JingMing
    SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (10) : 1 - 14
  • [6] Coding for Two-User Energy Harvesting Interference Channel
    Dabirnia, Mehdi
    Duman, Tolga M.
    IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, 2020, 4 (03): : 794 - 803
  • [7] On the DoF of Two-User Interference Channel with an Instantaneous Relay
    Liu, Tang
    Tuninetti, Daniela
    Chung, Sae-Young
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1049 - 1053
  • [8] The Stability Region of the Two-User Interference Channel
    Pappas, Nikolaos
    Kountouris, Marios
    Ephremides, Anthony
    2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
  • [9] Two-User SIMO Interference Channel With Treating Interference as Noise: Improper Signaling Versus Time-Sharing
    Hellings, Christoph
    Askerbeyli, Ferhad
    Utschick, Wolfgang
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 : 6467 - 6480
  • [10] Improper Signaling Versus Time-Sharing in the Two-User Gaussian Interference Channel With TIN
    Hellings, Christoph
    Utschick, Wolfgang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (05) : 2988 - 2999