Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Secrecy capacity region of a class of two-user Gaussian MIMO BC with degraded message sets

Hon-Fah Chong, Ying‐Chang Liang

Published Jul 1, 2013• 4 citations
Publisher

Abstract

We consider a two-user broadcast channel (BC) with two-degraded message sets where a common message M2is intended for both receivers and a private message M1is intended for receiver one. There is an eavesdropper whose channel is stochastically degraded with respect to both receivers and both messages must be kept confidential from the eavesdropper. However, we do not assume any form of degradedness between the two receivers. We first characterize the capacity region of this class of discrete memoryless BC. Next, we consider the two-user Gaussian MIMO BC with two-degraded message sets and an eavesdropper. We characterize the capacity region for the case where the eavesdropper is only required to be stochastically degraded with respect to receiver one. We make use of the channel enhancement technique as well as an extremal entropy inequality of Liu et al. that was derived using the generalized Costa's entropy power inequality (EPI).

DOI
10.1109/isit.2013.6620578

Related papers

The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel

Ghadamali Bagherikaram, Seyed Abolfazl Motahari, Amir Keyvan Khandani

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian multiple-input multiple-output (MIMO) broadcast channel. An eavesdropper also receives the transmitted signal via another MIMO channel. We first consider the discrete memoryless channel and obtain the capacity region of the degraded channel. The secret dirty paper coding (SDPC) region as an achievable rate region for the general discrete channel is introduced. Relying on the results for the discrete channel, we fully characterize the secrecy capacity region of MIMO broadcast channel. It is shown that the SDPC scheme is optimal. The converse part of the proof relies on the generalized Costa's entropy power inequality and a new channel enhancement strategy in which we only need to enhance the channels of the legitimate receivers, and the channel of the eavesdropper remains unchanged.

IEEE Transactions on Information Theory•Jan 21, 2013•50 citations

Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages

Hung D. Ly, Tie Liu, Yingbin Liang

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. A matrix characterization of the secrecy capacity region is established via a channel enhancement argument. The enhanced channel is constructed by first splitting receiver 1 into two virtual receivers and then enhancing only the virtual receiver that decodes the confidential message. The secrecy capacity region of the enhanced channel is characterized using an extremal entropy inequality previously established for characterizing the capacity region of a degraded compound MIMO Gaussian broadcast channel.

arXiv:0907.2599•IEEE Transactions on Information Theory•Oct 20, 2010•78 citations

MIMO Gaussian broadcast channels with private and confidential messages and with receiver side information

Rafael F. Schaefer, H. Vincent Poor, Holger Boche

In this paper the two-receiver MIMO Gaussian broadcast channel with private and confidential messages and receiver side information is studied. In this communication scenario, each receiver is interested in one private and one confidential message having the other private message as side information for decoding available. Each confidential message is exclusively intended for one receiver and must therefore be kept secret from the other receiver. A complete characterization of the secrecy capacity region is established using channel enhancement arguments and an extremal entropy inequality.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2013•0 citations

Secrecy capacity region of the degraded compound multi-receiver wiretap channel

Ersen Ekrem, Şennur Ulukuş

We study the degraded compound multi-receiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first scenario, both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multi-input multi-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario, the message sent to the first group of users needs to be kept confidential from both the second group of users and eavesdroppers, whereas the message sent to the second group of users needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. We find the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we obtain the secrecy capacity region when there is only one user in the second group.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2009•12 citations

An achievable scheme for the one-receiver, two-eavesdropper broadcast channel

Sadaf Salehkalaibar, Mohammad Reza Aref

In this paper, we consider the secrecy of the one-receiver, two-eavesdropper Broadcast Channel (BC) with three degraded message sets. There is a three-receiver BC where the common message is decoded by all receivers. The first confidential message is decoded by the first and the second receivers and is kept secret from the third receiver (eavesdropper). The second confidential message is decoded by the first receiver and is kept secret from the second and the third receivers (eavesdroppers). We propose an achievable scheme to find an inner bound to the secrecy capacity region of a class of one-receiver, two-eavesdropper BCs with three degraded message sets. We also compare our inner bound with another existing achievable region.

Iran Workshop on Communication and Information Theory (IWCIT)•May 1, 2014•0 citations

One-Receiver Two-Eavesdropper Broadcast Channel With Degraded Message Sets

Sadaf Salehkalaibar, Mahtab Mirmohseni, Mohammad Reza Aref

In this paper, we study the one-receiver two-eavesdropper Broadcast Channel (BC) with three degraded message sets. A common message is sent to three receivers. Another message is sent to the first and second receivers and needs to be kept secret from the third receiver (second eavesdropper). The third message is sent to the first receiver and needs to be kept secret from the second and third receivers (first and second eavesdroppers). First, we consider perfect secrecy conditions at the eavesdroppers, where we find an achievable perfect secrecy region. In the achievability scheme, we use superposition coding which divides the available randomness into different levels. These levels are used to mislead the eavesdroppers. The proposed coding scheme determines the perfect secrecy capacity region of the one-receiver two-eavesdropper BC with three degraded message sets, when the receivers exhibit a degradedness order. Next, we find an achievable rate-equivocation region using the rate splitting technique and indirect decoding. We show that for the two-receiver one-eavesdropper BC with three degraded message sets where we relax the secrecy condition at the second receiver, our coding scheme is optimal when the second receiver is a degraded version of the first receiver and it is less noisy than the third receiver.

IEEE Transactions on Information Forensics and Security•May 22, 2013•15 citations
We consider a two-user broadcast channel (BC) with two-degraded message sets where a common message M2is intended for both receivers and a private message M1is intended for receiver one. There is an eavesdropper whose channel is stochastically degraded with respect to both receivers and both messages must be kept confidential from the eavesdropper. However, we do not assume any form of degradedness between the two receivers. We first characterize the capacity region of this class of discrete memoryless BC. Next, we consider the two-user Gaussian MIMO BC with two-degraded message sets and an eavesdropper. We characterize the capacity region for the case where the eavesdropper is only required to be stochastically degraded with respect to receiver one. We make use of the channel enhancement technique as well as an extremal entropy inequality of Liu et al. that was derived using the generalized Costa's entropy power inequality (EPI).
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian multiple-input multiple-output (MIMO) broadcast channel. An eavesdropper also receives the transmitted signal via another MIMO channel. We first consider the discrete memoryless channel and obtain the capacity region of the degraded channel. The secret dirty paper coding (SDPC) region as an achievable rate region for the general discrete channel is introduced. Relying on the results for the discrete channel, we fully characterize the secrecy capacity region of MIMO broadcast channel. It is shown that the SDPC scheme is optimal. The converse part of the proof relies on the generalized Costa's entropy power inequality and a new channel enhancement strategy in which we only need to enhance the channels of the legitimate receivers, and the channel of the eavesdropper remains unchanged.
This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. A matrix characterization of the secrecy capacity region is established via a channel enhancement argument. The enhanced channel is constructed by first splitting receiver 1 into two virtual receivers and then enhancing only the virtual receiver that decodes the confidential message. The secrecy capacity region of the enhanced channel is characterized using an extremal entropy inequality previously established for characterizing the capacity region of a degraded compound MIMO Gaussian broadcast channel.
In this paper the two-receiver MIMO Gaussian broadcast channel with private and confidential messages and receiver side information is studied. In this communication scenario, each receiver is interested in one private and one confidential message having the other private message as side information for decoding available. Each confidential message is exclusively intended for one receiver and must therefore be kept secret from the other receiver. A complete characterization of the secrecy capacity region is established using channel enhancement arguments and an extremal entropy inequality.
We study the degraded compound multi-receiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first scenario, both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multi-input multi-output (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario, the message sent to the first group of users needs to be kept confidential from both the second group of users and eavesdroppers, whereas the message sent to the second group of users needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. We find the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we obtain the secrecy capacity region when there is only one user in the second group.
In this paper, we consider the secrecy of the one-receiver, two-eavesdropper Broadcast Channel (BC) with three degraded message sets. There is a three-receiver BC where the common message is decoded by all receivers. The first confidential message is decoded by the first and the second receivers and is kept secret from the third receiver (eavesdropper). The second confidential message is decoded by the first receiver and is kept secret from the second and the third receivers (eavesdroppers). We propose an achievable scheme to find an inner bound to the secrecy capacity region of a class of one-receiver, two-eavesdropper BCs with three degraded message sets. We also compare our inner bound with another existing achievable region.
In this paper, we study the one-receiver two-eavesdropper Broadcast Channel (BC) with three degraded message sets. A common message is sent to three receivers. Another message is sent to the first and second receivers and needs to be kept secret from the third receiver (second eavesdropper). The third message is sent to the first receiver and needs to be kept secret from the second and third receivers (first and second eavesdroppers). First, we consider perfect secrecy conditions at the eavesdroppers, where we find an achievable perfect secrecy region. In the achievability scheme, we use superposition coding which divides the available randomness into different levels. These levels are used to mislead the eavesdroppers. The proposed coding scheme determines the perfect secrecy capacity region of the one-receiver two-eavesdropper BC with three degraded message sets, when the receivers exhibit a degradedness order. Next, we find an achievable rate-equivocation region using the rate splitting technique and indirect decoding. We show that for the two-receiver one-eavesdropper BC with three degraded message sets where we relax the secrecy condition at the second receiver, our coding scheme is optimal when the second receiver is a degraded version of the first receiver and it is less noisy than the third receiver.