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

On the Secrecy Capacity Region of Parallel Broadcast Channel with Common and Confidential Messages.

Ahmed Benfarah, Stefano Tomasin, Nicola Laurenti

Published Mar 27, 2014• 0 citations
OpenAlex

Abstract

We consider a broadcast communication system over parallel sub-channels where the transmitter sends a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. Assuming perfect channel state information at the transmitter, the characterization of the boundary for the secrecy capacity region turns into solving a power allocation optimization problem. We derive the power allocation algorithm reaching the boundary of the secrecy capacity region under an average total power constraint. Numerical simulations are presented in comparison to existing power allocation schemes, showing the merit of the proposed algorithm.

Related papers

Parallel BCC with one common and two confidential messages and imperfect CSIT

Ahmed Benfarah, Stefano Tomasin, Nicola Laurenti

We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. We assume partial channel state information at the transmitter (CSIT), stemming from noisy channel estimation. The first contribution of this paper is the characterization of the secrecy capacity region boundary as the solution of weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by adding a margin to the estimated channel gains. The second paper contribution is the solution of this problem in an almost closed-form, where only two single real parameters must be optimized, e.g., through dichotomic searches. On the one hand, the considered problem generalizes existing literature where only two out of the three messages are transmitted. On the other hand, the solution finds also practical applications into the resource allocation of orthogonal frequency division multiplexing (OFDM) systems with both secrecy and fairness constraints.

arXiv:1403.6982•IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2014•2 citations

Secrecy Capacity Region of Fading Broadcast Channels

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.

arXiv:0707.1470•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•37 citations

Secure Communication Over Fading Channels

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.

IEEE Transactions on Information Theory•May 29, 2008•936 citations

Secure Communication over Fading Channels

Yingbin Liang, H. Vincent Poor, Shamai, Shlomo

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. Both the ergodic and outage performances are studied.

arXiv:cs/0701024•Allerton Conference on Communication, Control, and Computing•Jan 4, 2007•69 citations

Ergodic Secrecy Capacity Region of the Fading Broadcast Channel

Ersen Ekrem, Şennur Ulukuş

We consider the fading broadcast channel from a secrecy point of view. In this channel, each user views the other user as an eavesdropper, and wants to keep its information as secret from the other user as possible. First, we consider a more general channel model which consists of L independent sub-channels, where in each sub-channel, one of the users' channel is less noisy with respect to the other user. Since the user which has the less noisy observation can be different in each sub-channel, the overall channel is not less noisy for any one of the users. We establish the secrecy capacity region of this channel for the case where the transmitter sends a common message to both users and an individual confidential message to each user. This channel model encompasses the sub-class of channels, where in each sub-channel, one of the users' observation is degraded with respect to the other user. The parallel Gaussian broadcast channel belongs to this sub-class. In the Gaussian case, we identify the optimum input distribution, which is Gaussian, and the optimum power allocation corresponding to each point on the boundary of the secrecy capacity region. Finally, noting that the fading Gaussian broadcast channel is equivalent to a parallel Gaussian broadcast channel from an ergodic capacity perspective, we explicitly evaluate the ergodic secrecy capacity region of the fading broadcast channel.

International Conference on Communications•Jun 1, 2009•12 citations

Secrecy Capacity Region of Parallel Broadcast Channels

Yingbin Liang, H. Vincent Poor, Shlomo Shitz Shamai

The parallel broadcast channel with confidential messages (BCC) is investigated, where a source node transmits to two receivers (receivers 1 and 2) over multiple independent subchannels. The source node has common information for both receivers, and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The secrecy capacity region of the parallel BCC is established. It is shown that independent input distribution for each subchannel is optimal. It is also shown that the secrecy capacity region of the parallel BCC can be larger than the sum of the secrecy capacity regions of the subchannels. The secrecy capacity region is further derived for the parallel BCC with degraded subchannels. Applications of these results to the fading BCC are also discussed.

Information Theory and Applications Workshop (ITA)•Jan 1, 2007•14 citations
We consider a broadcast communication system over parallel sub-channels where the transmitter sends a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. Assuming perfect channel state information at the transmitter, the characterization of the boundary for the secrecy capacity region turns into solving a power allocation optimization problem. We derive the power allocation algorithm reaching the boundary of the secrecy capacity region under an average total power constraint. Numerical simulations are presented in comparison to existing power allocation schemes, showing the merit of the proposed algorithm.
We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. We assume partial channel state information at the transmitter (CSIT), stemming from noisy channel estimation. The first contribution of this paper is the characterization of the secrecy capacity region boundary as the solution of weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by adding a margin to the estimated channel gains. The second paper contribution is the solution of this problem in an almost closed-form, where only two single real parameters must be optimized, e.g., through dichotomic searches. On the one hand, the considered problem generalizes existing literature where only two out of the three messages are transmitted. On the other hand, the solution finds also practical applications into the resource allocation of orthogonal frequency division multiplexing (OFDM) systems with both secrecy and fairness constraints.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established, which gives the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. The ergodic performance is first studied. The ergodic secrecy capacity region and the optimal power allocations that achieve the boundary of this region are derived. The outage performance is then studied, where a long-term power constraint is assumed. The power allocation is derived that minimizes the outage probability where either the target rate of the common message or the target rate of the confidential message is not achieved. The power allocation is also derived that minimizes the outage probability where the target rate of the confidential message is not achieved subject to the constraint that the target rate of the common message must be achieved for all channel states.
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an information-theoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then applied to study the fading BCC. Both the ergodic and outage performances are studied.
We consider the fading broadcast channel from a secrecy point of view. In this channel, each user views the other user as an eavesdropper, and wants to keep its information as secret from the other user as possible. First, we consider a more general channel model which consists of L independent sub-channels, where in each sub-channel, one of the users' channel is less noisy with respect to the other user. Since the user which has the less noisy observation can be different in each sub-channel, the overall channel is not less noisy for any one of the users. We establish the secrecy capacity region of this channel for the case where the transmitter sends a common message to both users and an individual confidential message to each user. This channel model encompasses the sub-class of channels, where in each sub-channel, one of the users' observation is degraded with respect to the other user. The parallel Gaussian broadcast channel belongs to this sub-class. In the Gaussian case, we identify the optimum input distribution, which is Gaussian, and the optimum power allocation corresponding to each point on the boundary of the secrecy capacity region. Finally, noting that the fading Gaussian broadcast channel is equivalent to a parallel Gaussian broadcast channel from an ergodic capacity perspective, we explicitly evaluate the ergodic secrecy capacity region of the fading broadcast channel.
The parallel broadcast channel with confidential messages (BCC) is investigated, where a source node transmits to two receivers (receivers 1 and 2) over multiple independent subchannels. The source node has common information for both receivers, and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The secrecy capacity region of the parallel BCC is established. It is shown that independent input distribution for each subchannel is optimal. It is also shown that the secrecy capacity region of the parallel BCC can be larger than the sum of the secrecy capacity regions of the subchannels. The secrecy capacity region is further derived for the parallel BCC with degraded subchannels. Applications of these results to the fading BCC are also discussed.