The Role of Feedback in Two-Way Secure Communications

被引:33
作者
He, Xiang [1 ]
Yener, Aylin [1 ]
机构
[1] Penn State Univ, Dept Elect Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
Cooperative jamming; feedback; information theoretic security; two-way relay channel; two-way wiretap channel; COMMON RANDOMNESS; MULTIPLE-ACCESS; CHANNELS; TRANSMISSION; SECRECY; REGION;
D O I
10.1109/TIT.2013.2281711
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Most practical communication links are bidirectional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a practical point of view, it would also be desirable to identify the cases where such an encoder design may not improve communication rates. This question is particularly interesting for the case where the transmitted messages and the feedback signals are subject to eavesdropping. In this paper, we investigate the question of how much impact the feedback has on the secrecy capacity by studying two fundamental models. First, we consider the Gaussian two-way wiretap channel and derive an outer bound for its secrecy capacity region. We show that the secrecy rate loss can be unbounded when feedback signals are not utilized except for a special case we identify, and thus conclude that utilizing feedback can be highly beneficial in general. Second, we consider a half-duplex Gaussian two-way relay channel where the relay node is also an eavesdropper, and find that the impact of feedback is less pronounced compared to the previous scenario. Specifically, the loss in secrecy rate, when ignoring the feedback, is quantified to be less than 0.5 bit per channel use when the relay power goes to infinity. This achievable rate region is obtained with simple time sharing along with cooperative jamming, which, with its simplicity and near optimum performance, is a viable alternative to an encoder that utilizes feedback signals.
引用
收藏
页码:8115 / 8130
页数:16
相关论文
共 30 条
[1]  
Ahlswede R, 2006, LECT NOTES COMPUT SC, V4123, P258
[2]   COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING [J].
AHLSWEDE, R ;
CSISZAR, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1121-1132
[3]   Secrecy rates of binary wiretapper channels using feedback schemes [J].
Amariucai, George T. ;
Wei, Shuangqing .
2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, :624-629
[4]  
[Anonymous], 2006, Elements of Information Theory
[5]  
[Anonymous], RELAY CHANNELS CONFI
[6]   Wiretap Channel With Secure Rate-Limited Feedback [J].
Ardestanizadeh, Ehsan ;
Franceschetti, Massimo ;
Javidi, Tara ;
Kim, Young-Han .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) :5353-5361
[7]   Confidential messages to a cooperative relay [J].
Bloch, Matthieu ;
Thangaraj, Andrew .
2008 IEEE INFORMATION THEORY WORKSHOP, 2008, :154-+
[8]   Channel Scrambling for Secrecy [J].
Bloch, Matthieu .
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :2452-2456
[9]   AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACK [J].
COVER, TM ;
LEUNG, CSK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (03) :292-298
[10]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892