Strong Secrecy in Bidirectional Broadcast Channels With Confidential Messages

To increase the spectral efficiency of future wireless networks, it is important to wisely integrate multiple services at the physical layer. Here the efficient integration of confidential services in the three-node bidirectional relay channel is studied. A relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol, which is also known as two-way relaying. In the broadcast phase, the relay transmits not only the two bidirectional messages it received in the previous multiple access phase, but also an additional confidential message to one node while keeping the other node completely ignorant of it. The concept of strong information theoretic secrecy is used to ensure that the nonlegitimate node cannot decode the confidential message no matter what its computational resources are. Moreover, this implies that the average decoding error at the nonlegitimate node goes exponentially fast to one for any decoding strategy it may use. This results in the study of the bidirectional broadcast channel with confidential messages for which the strong secrecy capacity region is established. Furthermore, it is shown that the efficient integration of confidential messages with strong secrecy extends to such scenarios, where the relay further transmits an additional common message to both nodes.

[1]  S. Stanczak,et al.  Achievable Rates for the Restricted Half-Duplex Two-Way Relay Channel , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[2]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[3]  Alexander Sprintson,et al.  Joint Physical Layer Coding and Network Coding for Bidirectional Relaying , 2008, IEEE Transactions on Information Theory.

[4]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[5]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[6]  Shlomo Shamai,et al.  MIMO Gaussian broadcast channels with confidential and common messages , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Holger Boche,et al.  How to achieve privacy in bidirectional relay networks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[8]  Matthieu R. Bloch,et al.  Physical-Layer Security: From Information Theory to Security Engineering , 2011 .

[9]  Holger Boche,et al.  Bidirectional broadcast channels with common and confidential messages , 2011, 2011 IEEE Information Theory Workshop.

[10]  Sennur Ulukus,et al.  Capacity Region of Gaussian MIMO Broadcast Channels With Common and Confidential Messages , 2010, IEEE Transactions on Information Theory.

[11]  Holger Boche,et al.  Capacity results for compound wiretap channels , 2011, 2011 IEEE Information Theory Workshop.

[12]  H. Vincent Poor,et al.  Multiple-Access Channels With Confidential Messages , 2008, IEEE Transactions on Information Theory.

[13]  Carles Padró,et al.  Information Theoretic Security , 2013, Lecture Notes in Computer Science.

[14]  Mai H. Vu,et al.  Compress-forward without Wyner-Ziv binning for the one-way and two-way relay channels , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Sae-Young Chung,et al.  Layered Noisy Network Coding , 2010, 2010 Third IEEE International Workshop on Wireless Network Coding.

[16]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.

[17]  Gerhard Kramer,et al.  On message lengths for noisy network coding , 2011, 2011 IEEE Information Theory Workshop.

[18]  Shlomo Shamai,et al.  Compound Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..

[19]  Tobias J. Oechtering,et al.  MIMO Gaussian Bidirectional Broadcast Channels with Common Messages , 2011, IEEE Transactions on Wireless Communications.

[20]  Niklas Johansson,et al.  Coded Bi-directional Relaying , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[21]  Matthieu R. Bloch,et al.  Strong Secrecy for Wireless Channels (Invited Talk) , 2008, ICITS.

[22]  Alexandre J. Pierrot,et al.  Strongly Secure Communications Over the Two-Way Wiretap Channel , 2010, IEEE Transactions on Information Forensics and Security.

[23]  Eduard A. Jorswieck,et al.  Secrecy on the Physical Layer in Wireless Networks , 2010 .

[24]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[25]  Amiel Feinstein,et al.  Information and information stability of random variables and processes , 1964 .

[26]  Aylin Yener,et al.  A New Outer Bound for the Secrecy Capacity Region of the Gaussian Two-Way Wiretap Channel , 2010, 2010 IEEE International Conference on Communications.

[27]  Tobias J. Oechtering,et al.  Optimal Coding Strategies for Bidirectional Broadcast Channels Under Channel Uncertainty , 2010, IEEE Transactions on Communications.

[28]  P. Shields The Ergodic Theory of Discrete Sample Paths , 1996 .

[29]  Tobias J. Oechtering,et al.  Broadcast Capacity Region of Two-Phase Bidirectional Relaying , 2007, IEEE Transactions on Information Theory.

[30]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

[31]  Ying-Chang Liang,et al.  Optimal beamforming for two-way multi-antenna relay channel with analogue network coding , 2008, IEEE Journal on Selected Areas in Communications.

[32]  Moustafa Youssef,et al.  New achievable secrecy rate regions for the two way wiretap channel , 2010 .

[33]  S. Shamai,et al.  Capacity for Classes of Broadcast Channels with Receiver Side Information , 2007, 2007 IEEE Information Theory Workshop.

[34]  Matthieu R. Bloch,et al.  Secrecy from Resolvability , 2011, ArXiv.

[35]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[36]  RankovBoris,et al.  Spectral efficient protocols for half-duplex fading relay channels , 2007 .

[37]  H. Vincent Poor,et al.  Secure Communications Over Wireless Broadcast Networks: Stability and Utility Maximization , 2011, IEEE Transactions on Information Forensics and Security.

[38]  Natasha Devroye,et al.  A lattice compress-and-forward scheme , 2011, 2011 IEEE Information Theory Workshop.

[39]  Lawrence Ong,et al.  Functional-decode-forward for the general discrete memoryless two-way relay channel , 2010, 2010 IEEE International Conference on Communication Systems.

[40]  Igor Devetak The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

[41]  Vahid Tarokh,et al.  New Directions in Wireless Communications Research , 2009 .

[42]  Patrick Mitran,et al.  Performance Bounds for Bidirectional Coded Cooperation Protocols , 2007, IEEE Transactions on Information Theory.

[43]  NamWooseok,et al.  Capacity of the Gaussian two-way relay channel to within 1/2 bit , 2010 .

[44]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[45]  J. Barros,et al.  Strong Secrecy for Wireless Channels , 2008 .

[46]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[47]  J. Nayak,et al.  Rate regions for the separated two-way relay channel , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[48]  Armin Wittneben,et al.  Spectral efficient protocols for half-duplex fading relay channels , 2007, IEEE Journal on Selected Areas in Communications.

[49]  Roy D. Yates,et al.  Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions , 2007, IEEE Transactions on Information Theory.

[50]  H. Vincent Poor,et al.  A Unified Framework for Key Agreement Over Wireless Fading Channels , 2009, IEEE Transactions on Information Forensics and Security.

[51]  Holger Boche,et al.  Secrecy results for compound wiretap channels , 2011, Probl. Inf. Transm..

[52]  Ruoheng Liu,et al.  Securing Wireless Communications at the Physical Layer , 2014 .

[53]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.