Achievable Secrecy Rate Region of Two-Way Communication with Secret Key Feedback

This paper investigates the achievable secrecy rate region of the Gaussian two-way wiretap channel, which describes the simultaneous secure two-way transmission of a confidential message. Through adjusting the time-sharing factor and the rate at which the random secret key is fed back, the allocation and optimization for the secrecy rates of two-way communication are achieved. Under peak and average power constraints, the achievable secrecy rate regions of the two-way communication are derived respectively.

[1]  Alfred O. Hero,et al.  Secure space-time communication , 2003, IEEE Trans. Inf. Theory.

[2]  Tao Li,et al.  Secrecy rate region of independent parallel multiple-carrier two-way secure communications with secure feedback , 2015, 2015 International Conference on Wireless Communications & Signal Processing (WCSP).

[3]  Sennur Ulukus,et al.  Achievable Rates in Gaussian MISO Channels with Secrecy Constraints , 2007, 2007 IEEE International Symposium on Information Theory.

[4]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[5]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[6]  Rudolf Ahlswede,et al.  Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder , 2006, GTIT-C.

[7]  Massimo Franceschetti,et al.  Wiretap Channel With Secure Rate-Limited Feedback , 2009, IEEE Transactions on Information Theory.

[8]  H. Vincent Poor,et al.  Secrecy Capacity of the Wiretap Channel with Noisy Feedback , 2007, ArXiv.

[9]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[10]  R. Negi,et al.  Secret communication using artificial noise , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[11]  Roy D. Yates,et al.  Secret Communication via Multi-antenna Transmission , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  H. Vincent Poor,et al.  Secure Communications With Insecure Feedback: Breaking the High-SNR Ceiling , 2010, IEEE Transactions on Information Theory.

[14]  H. Vincent Poor,et al.  The Wiretap Channel With Feedback: Encryption Over the Channel , 2007, IEEE Transactions on Information Theory.

[15]  George T. Amariucai,et al.  Feedback-Based Collaborative Secrecy Encoding Over Binary Symmetric Channels , 2012, IEEE Transactions on Information Theory.

[16]  Qinye Yin,et al.  Secret Wireless Communication with Public Feedback by Common Randomness , 2014, IEEE Wireless Communications Letters.

[17]  Sik Kow Leung-Yan-Cheong.  Multi-user and wiretap channels including feedback , 1976 .

[18]  H. Vincent Poor,et al.  Secret communication with feedback , 2008, 2008 International Symposium on Information Theory and Its Applications.

[19]  Nan Liu,et al.  Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel , 2007, IEEE Transactions on Information Theory.

[20]  Asaf Cohen,et al.  Wiretap Channel With Causal State Information and Secure Rate-Limited Feedback , 2016, IEEE Trans. Commun..

[21]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[22]  Javier Vía,et al.  Time and power allocation for the Gaussian wiretap channel with feedback of secret keys , 2015, 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).