On the Capacity of the Two-User Symmetric Interference Channel With Transmitter Cooperation and Secrecy Constraints

被引:12
作者
Mohapatra, Parthajit [1 ,2 ]
Murthy, Chandra R. [3 ]
机构
[1] IISc Bangalore, Dept Elect Commun Engn, Bangalore 560012, Karnataka, India
[2] Singapore Univ Technol & Design, Singapore 487372, Singapore
[3] IISc Bangalore, Bangalore 560012, Karnataka, India
关键词
Interference channel; information theoretic secrecy; deterministic approximation; cooperation; GAUSSIAN BROADCAST CHANNEL; CONFIDENTIAL MESSAGES; COMMUNICATION; MITIGATION; REGION;
D O I
10.1109/TIT.2016.2593624
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the two-user Gaussian symmetric interference channel (IC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model parameters. Outer bounds on the secrecy rate are also derived, using a novel partitioning of the encoded messages and outputs depending on the relative strength of the signal and the interference. The partitioning helps to bound certain negative entropy terms, leading to a tractable outer bound. The inner and outer bounds are derived under all possible parameter settings. It is found that, for some parameter settings, the inner and outer bounds match, yielding the capacity of the SLDIC under transmitter cooperation and secrecy constraints. In some other scenarios, the achievable rate matches with the capacity region of the two-user SLDIC without secrecy constraints derived by Wang and Tse; thus, the proposed scheme offers secrecy for free, in these cases. Inspired by the achievable schemes and outer bounds in the deterministic case, achievable schemes and outer bounds are derived in the Gaussian case. The proposed achievable scheme for the Gaussian case is based on Marton's coding scheme and stochastic encoding along with dummy message transmission. One of the key techniques used in the achievable scheme for both the models is interference cancelation, which simultaneously offers two seemingly conflicting benefits: it cancels interference and ensures secrecy. Many of the results derived in this paper extend to the asymmetric case also. The results show that limited transmitter cooperation can greatly facilitate secure communications over two-user ICs.
引用
收藏
页码:5664 / 5689
页数:26
相关论文
共 36 条
  • [1] Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels
    Aggarwal, Vaneet
    Sankar, Lalitha
    Calderbank, A. Robert
    Poor, H. Vincent
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2009,
  • [2] Ahlswede R., 1971, P 2 INT S INF THEOR, P1
  • [3] [Anonymous], 1972, THESIS
  • [4] Wireless Network Information Flow: A Deterministic Approach
    Avestimehr, A. Salman
    Diggavi, Suhas N.
    Tse, David N. C.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 1872 - 1905
  • [5] Awan Z. H., 2012, MULTIACCESS CHANNEL
  • [6] On the achievable throughput of a multiantenna Gaussian broadcast channel
    Caire, G
    Shamai, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) : 1691 - 1706
  • [7] CASE WHERE INTERFERENCE DOES NOT REDUCE CAPACITY
    CARLEIAL, AB
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 569 - 570
  • [8] Effects of cooperation on the secrecy of multiple access channels with generalized feedback
    Ekrem, Ersen
    Ulukus, Sennur
    [J]. 2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, : 791 - 796
  • [9] Secrecy in Cooperative Relay Broadcast Channels
    Ekrem, Ersen
    Ulukus, Sennur
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (01) : 137 - 155
  • [10] Secret Writing on Dirty Paper: A Deterministic View
    El-Halabi, Mustafa
    Liu, Tie
    Georghiades, Costas N.
    Shamai , Shlomo
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3419 - 3429