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 条
  • [41] Virtual Wiretap Channel Based on Wireless Two-way Interferometry
    Shiga, Nobuyasu
    Yasuda, Satoshi
    Yonaga, Kouki
    Takizawa, Kenichi
    Yoshida, Maki
    2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), 2022, : 6188 - 6193
  • [42] The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel
    Bagherikaram, Ghadamali
    Motahari, Abolfazl Seyed
    Khandani, Amir Keyvan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) : 2673 - 2682
  • [43] Achieving Shannon Capacity Region as Secrecy Rate Region in a Multiple Access Wiretap Channel
    Shah, Shahid Mehraj
    Sharma, Vinod
    2015 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2015, : 759 - 764
  • [44] Capacity of Two-Way Relay Channel
    Zhang, Shengli
    Liew, Soung Chang
    Wang, Hui
    Lin, Xiaohui
    ACCESS NETWORKS, 2010, 37 : 219 - +
  • [45] Secrecy Capacity of the Degraded Poisson Wiretap Channel
    Laourine, Amine
    Wagner, Aaron B.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 2553 - 2557
  • [46] An outer bound to the capacity region of the broadcast channel
    Nair, Chandra
    El Gamal, Abbas
    2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2205 - +
  • [47] An outer bound to the capacity region of the broadcast channel
    Nair, Chandra
    El Gamal, Abbas
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (01) : 350 - 355
  • [48] Approaching the Capacity of Two-Way Gaussian Relay Channel with Relay Private Messages
    Ghabeli, Leila
    Derpich, Milan S.
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2729 - 2733
  • [49] Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive
    Nam, Seung-Hyun
    Lee, Si-Hyeon
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 155 - 159
  • [50] Capacity of the Gaussian Two-Way Relay Channel to Within 1/2 Bit
    Nam, Wooseok
    Chung, Sae-Young
    Lee, Yong H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (11) : 5488 - 5494