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 条
  • [21] Secrecy Capacity of a Gaussian Wiretap Channel With ADCs is Always Positive
    Nam, Seung-Hyun
    Lee, Si-Hyeon
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (02) : 1186 - 1196
  • [22] A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results
    Weng, Jian-Jia
    Alajaji, Fady
    Linder, Tamas
    PROCEEDINGS OF 2020 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2020), 2020, : 324 - 328
  • [23] On the Secrecy Capacity Region of a Class of Parallel Wiretap Broadcast Channel
    Benammar, Meryem
    Piantanida, Pablo
    2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2014, : 1072 - 1077
  • [24] Efficient Numerical Methods for Secrecy Capacity of Gaussian MIMO Wiretap Channel
    Mukherjee, Anshu
    Ottersten, Bjorn
    Le Nam Tran
    2021 IEEE 93RD VEHICULAR TECHNOLOGY CONFERENCE (VTC2021-SPRING), 2021,
  • [25] A New Outer Bound on the Capacity Region of Gaussian Interference Channels
    Nam, Junyoung
    Caire, Giuseppe
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [26] Capacity region of the Gaussian doubly dirty two-way channel in the presence of partial side information
    Monemizadeh, Narges
    Hodtani, Ghosheh Abed
    TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2016, 27 (03): : 420 - 427
  • [27] Secrecy Capacity Region of Gaussian Broadcast Channel
    Bagherikaram, Ghadamali
    Motahari, Abolfazl S.
    Khandani, Amir K.
    2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2009, : 152 - 157
  • [28] Secure Polar Coding for the Two-Way Wiretap Channel
    Zheng, Mengfan
    Tao, Meixia
    Chen, Wen
    Ling, Cong
    IEEE ACCESS, 2018, 6 : 21731 - 21744
  • [29] Secrecy Rate of Resource-Constrained Mobile Relay Model under Two-Way Wiretap Channel
    Wang, Hongmei
    Wang, Yinchun
    Wu, Meng
    APPLIED SCIENCES-BASEL, 2021, 11 (21):
  • [30] The Secrecy Capacity of the MIMO Wiretap Channel
    Oggier, Frederique
    Hassibi, Babak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) : 4961 - 4972