Bidirectional broadcast channels with common and confidential messages

In this work, we study the bidirectional broadcast channel with common and confidential messages and establish the capacity-equivocation and secrecy capacity regions. This problem is motivated by the concept of bidirectional relaying in a three-node network, where a relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby efficiently integrates additional common and confidential services.

[1]  Onurcan Iscan,et al.  Network coded multi-way relaying with iterative decoding , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[2]  Shlomo Shamai,et al.  Secrecy-achieving polar-coding , 2010, 2010 IEEE Information Theory Workshop.

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

[4]  Holger Boche,et al.  MIMO Bidirectional Broadcast Channels with Common Message , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[5]  Yingbin Liang,et al.  Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages , 2009, IEEE Transactions on Information Theory.

[6]  Alexander Vardy,et al.  Achieving the secrecy capacity of wiretap channels using Polar codes , 2010, ISIT.

[7]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[9]  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.

[10]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.

[11]  Mikael Skoglund,et al.  Nested Polar Codes for Wiretap and Relay Channels , 2010, IEEE Communications Letters.

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

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

[14]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

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

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

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

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

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

[20]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[21]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[22]  A. Lee Swindlehurst,et al.  Securing multi-antenna two-way relay channels with analog network coding against eavesdroppers , 2010, 2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

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

[24]  Onur Ozan Koyluoglu,et al.  Polar coding for secure transmission and key agreement , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

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

[26]  R. Urbanke,et al.  Polar codes for Slepian-Wolf, Wyner-Ziv, and Gelfand-Pinsker , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[27]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

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

[29]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

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

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

[32]  Slawomir Stanczak,et al.  On Coding for the Broadcast Phase in the Two-Way Relay Channel , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

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

[34]  Mikael Skoglund,et al.  Polar codes for compress-and-forward in binary relay channels , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[35]  Aydin Sezgin,et al.  Secrecy in Gaussian MIMO bidirectional broadcast wiretap channels: Transmit strategies , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[36]  Tobias J. Oechtering,et al.  Polar Coding for Bidirectional Broadcast Channels with Common and Confidential Messages , 2013, IEEE Journal on Selected Areas in Communications.