Secure Wireless Communications in Broadcast Channels With Confidential Messages
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 deliver...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8911309/ |
id |
doaj-9367320d06a746f9a996d576ff980918 |
---|---|
record_format |
Article |
spelling |
doaj-9367320d06a746f9a996d576ff9809182021-03-30T00:27:04ZengIEEEIEEE Access2169-35362019-01-01717052517053310.1109/ACCESS.2019.29556038911309Secure Wireless Communications in Broadcast Channels With Confidential MessagesMohammed Adil Abbas0https://orcid.org/0000-0002-6204-9016Hojin Song1https://orcid.org/0000-0002-8353-5662Jun-Pyo Hong2https://orcid.org/0000-0001-7478-8513Development and Continuous Education Center, University of Baghdad, Baghdad, IraqAgency for Defense Development (ADD), Daejeon, South KoreaDepartment of Information and Communications Engineering, Pukyong National University, Busan, South KoreaDelivering 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.https://ieeexplore.ieee.org/document/8911309/Physical layer securitybroadcast channelconfidential messagescommunication security |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Mohammed Adil Abbas Hojin Song Jun-Pyo Hong |
spellingShingle |
Mohammed Adil Abbas Hojin Song Jun-Pyo Hong Secure Wireless Communications in Broadcast Channels With Confidential Messages IEEE Access Physical layer security broadcast channel confidential messages communication security |
author_facet |
Mohammed Adil Abbas Hojin Song Jun-Pyo Hong |
author_sort |
Mohammed Adil Abbas |
title |
Secure Wireless Communications in Broadcast Channels With Confidential Messages |
title_short |
Secure Wireless Communications in Broadcast Channels With Confidential Messages |
title_full |
Secure Wireless Communications in Broadcast Channels With Confidential Messages |
title_fullStr |
Secure Wireless Communications in Broadcast Channels With Confidential Messages |
title_full_unstemmed |
Secure Wireless Communications in Broadcast Channels With Confidential Messages |
title_sort |
secure wireless communications in broadcast channels with confidential messages |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
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. |
topic |
Physical layer security broadcast channel confidential messages communication security |
url |
https://ieeexplore.ieee.org/document/8911309/ |
work_keys_str_mv |
AT mohammedadilabbas securewirelesscommunicationsinbroadcastchannelswithconfidentialmessages AT hojinsong securewirelesscommunicationsinbroadcastchannelswithconfidentialmessages AT junpyohong securewirelesscommunicationsinbroadcastchannelswithconfidentialmessages |
_version_ |
1724188280970280960 |