Secure Wireless Communications in Broadcast Channels With Confidential Messages

Mohammed Adil Abbas,Hojin Song,Jun-Pyo Hong

doi:10.1109/access.2019.2955603

Mohammed Adil Abbas, Hojin Song + Show 1 more

Open Access

https://doi.org/10.1109/access.2019.2955603

Copy DOI

Abstract

Delivering confidential messages in wireless network is gaining continuous attraction as a fundamental building block for the Internet of things (IoT). This paper overviews the confidential message transmission techniques in broadcast channel (BC) where a transmitter serves multiple users by delivering confidential messages to their intended users. Each confidential message must be prevented from extracting its information by any unintended users. First, we consider a basic network consisting of two users. In the two-user BC, the secret dirty paper coding (S-DPC) achieves the secrecy capacity region. However, since the DPC requires a high computational complexity for characterizing the capacity region, two sub-optimal transmission techniques with low complexities are explained. Second, we extend our discussion to the network including more than two users. For $K$ -user BC with confidential messages, the optimal transmission scheme and the secrecy capacity region have not yet been derived. Instead of presenting the optimal scheme, we explain two sub-optimal transmission techniques and compare their features and performances. In conclusion, we discuss the open problems in the confidential message transmission for networks with more than two users.

Highlights

The developments of wireless communication devices and technologies lead to rapid increase in the number of smart objects connected to the wireless network
Every confidential message transmission suffers from different set of eavesdroppers, and this makes the transmission strategy design more complicated than the wiretap broadcast channel, which deals with common external eavesdroppers
A two-user broadcast channel (BC) has been considered as a basic channel model, and its secrecy capacity region is shown to be achieved with secret dirty paper coding (S-dirty paper coding (DPC))

Summary

INTRODUCTION

The developments of wireless communication devices and technologies lead to rapid increase in the number of smart objects connected to the wireless network. Since the external eavesdroppers have no interaction with any terminal in the network, the channel state information (CSI) about the eavesdroppers is generally assumed to be unknown at the transmitter For this reason, it is impossible to always guarantee the communication security in wiretap BCs. Most works on wiretap BC have considered transmission strategies for guaranteeing security with a high probability instead of guaranteeing the security all the time [11]–[13]. For a user k, any unintended user i = k is considered as an eavesdropper, and the transmitter prevents it from extracting any information of Wk from its received signal yi For this reason, every confidential message transmission suffers from different set of eavesdroppers, and this makes the transmission strategy design more complicated than the wiretap broadcast channel, which deals with common external eavesdroppers.

OPTIMAL SCHEMES AND SECRECY CAPACITY REGIONS

SUB-OPTIMAL SCHEMES WITH LOW COMPUTATIONAL COMPLEXITY

CONCLUSION