A New Outer Bound for the Secrecy Capacity Region of the Gaussian Two-Way Wiretap Channel

被引:0
|
作者
He, Xiang [1 ]
Yener, Aylin [1 ]
机构
[1] Penn State Univ, Wireless Commun & Networking Lab, Dept Elect Engn, University Pk, PA 16802 USA
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We investigate the fundamental communication limits when messages are sent via a Gaussian two-way channel, which must at the same time be kept secret from an external eavesdropper. In this two-way wiretap channel that models two legitimate transceivers and an eavesdropping receiver, there are two techniques to provide confidentiality for the messages: one entails the legitimate nodes to jam the eavesdropper, i.e., cooperative jamming, while the other entails generating keys from the feedback signals received by the two legitimate nodes and using them to encrypt the messages. Previous work has shown that both methods can be used concurrently to improve the secrecy rates of a channel with a degradedness condition. In this work, we consider the general case, and derive a new outer bound for the secrecy capacity region of this channel. A case is identified where the loss in secrecy rate, due to ignoring the backward (feedback) link at each legitimate transmitter from the other, is bounded by a constant which only depends on the channel gains. This is the case when the power of the two legitimate nodes increases proportionally. In all other cases, we show that ignoring feedback signals causes unbounded loss in the secrecy rate. The loss is measured as the gap between the achievable rate when the feedback signals are taken into account, and the upper bound when the feedback is not used, and hence is not affected by the choice of the achievable scheme. This result therefore establishes that, for the Gaussian two-way channel with an external eavesdropper, the encoders need to be designed with memory. This is in contrast to the result for this channel in the absence of an eavesdropper.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Outer Bounds for the Capacity Region of a Gaussian Two-way Relay Channel
    Ashar, Ishaque K.
    Prathyusha, V
    Bhashyam, Srikrishna
    Thangaraj, Andrew
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 1645 - 1652
  • [2] Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel
    El Gamal, Aly
    Koyluoglu, Onur Ozan
    Youssef, Moustafa
    El Gamal, Hesham
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (12) : 8099 - 8114
  • [3] Secrecy Capacity Region of the Gaussian Multi-Receiver Wiretap Channel
    Ekrem, Ersen
    Ulukus, Sennur
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2612 - 2616
  • [4] On the Capacity Region of Asymmetric Gaussian Two-Way Line Channel
    Ghasemi-Goojani, Shahab
    Karimi-Bidhendi, Saeed
    Behroozi, Hamid
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (09) : 3669 - 3682
  • [5] One-sided secrecy over the two-way wiretap channel
    Qi, Chao
    Chen, Yanling
    Han Vinck, A. J.
    Tang, Xiaohu
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 626 - 630
  • [6] On the Secrecy Capacity of Fading Gaussian Wiretap Channel
    Hossan, Md. K.
    Karmakar, S.
    Ghosh, A.
    2015 IEEE 14TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT), 2015, : 36 - 40
  • [7] Adaptive Coding for Two-Way Wiretap Channel under Strong Secrecy
    Chen, Yanling
    Hayashi, Masahito
    arXiv,
  • [8] Gaussian Two-way Wiretap Channel with an Arbitrarily Varying Eavesdropper
    He, Xiang
    Yener, Aylin
    2011 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2011, : 854 - 858
  • [9] The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel
    Ekrem, Ersen
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2083 - 2114
  • [10] Secure Degree of Freedom Bound of Secret-Key Capacity for Two-Way Wiretap Channel
    Liang, Qingpeng
    Du, Linsong
    Wu, Yanzhi
    Ma, Zheng
    IEEE SIGNAL PROCESSING LETTERS, 2025, 32 : 581 - 585