Independent Confidential Messages Research Articles

Energy-Efficiency Maximization for Secure Multiuser MIMO SWIPT Systems With CSI Uncertainty

This paper studies the secure transmission issue for simultaneous wireless information and power transfer in a multiuser multiple-input-multiple-output system with multiple external eavesdroppers, where the transmitter broadcasts independent confidential messages to different legitimate receivers. Each receiver can be seen as an internal eavesdropper intended by other receivers. Our objective is to achieve the robust beamforming design under imperfect channel state information, in which the total transmission power is minimized with constraints on the achievable secrecy rate and the energy harvesting. Since the problem is nonconvex, we propose a two-level optimization scheme. For the inner problem, we investigate two conservative relaxation approaches, large-deviation inequality and Bernstein-type inequality (BTI), to reformulate the outage secrecy rate constraints into some convex ones, yielding a convex optimization by semidefinite programming (SDP) relaxation. For the outer problem, it is a K-variable optimization problem, which can be solved via the novel line-dimensional-like search method. Moreover, we characterize the rank profile of SDP relaxed solution for these two approaches. Specifically, the optimal solution is proved to be rank-one. Numerical results are provided to verify the performance of the proposed algorithms, where the LDI-based scheme outperforms the BTI-based scheme in terms of energy efficiency.

Ergodic Secrecy Sum-Rate for Downlink Multiuser MIMO Systems With Limited CSI Feedback

This paper investigates the ergodic secrecy sum-rate for the downlink multiuser MIMO system with independent confidential messages, each of which is intended for one of the users and should keep secret from others. We adopt zero-forcing beamforming with limited channel state information (CSI) feedback at the transmitter, and derive the closed-form expression for the ergodic secrecy sum-rate. Moreover, we analyze some of its asymptotic characteristics, which provide guidance on secure transmission design. Finally, all theoretical results are validated by numerical simulations.

Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages

Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.

Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> We study <emphasis emphasistype="boldital">information-theoretic security</emphasis> for discrete memoryless <emphasis emphasistype="boldital">interference</emphasis> and <emphasis emphasistype="boldital">broadcast</emphasis> channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers while ensuring mutual information-theoretic secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. In this paper, we present inner and outer bounds on secrecy capacity regions for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to both channel models. The difference is in the input distributions over which the expression is optimized. The inner bound rate regions are achieved by <emphasis emphasistype="boldital">random binning</emphasis> techniques. For the broadcast channel, a <emphasis emphasistype="boldital">double-binning</emphasis> coding scheme allows for both joint encoding and preserving of confidentiality. Furthermore, we show that, for a special case of the interference channel, referred to as the <emphasis emphasistype="boldital">switch</emphasis> channel, derived bounds meet. Finally, we describe several transmission schemes for Gaussian interference channels and derive their achievable rate regions while ensuring mutual information-theoretic secrecy. An encoding scheme in which transmitters dedicate some of their power to create <emphasis emphasistype="boldital">artificial noise</emphasis> is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages. </para>