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

Iranian Conference on Electrical Engineering

Secrecy Capacity Outer Bound of Broadcast Channels with States Known at the Transmitter and Message Side Information at Receivers

Saeid Pakravan, Ghosheh Abed Hodtani

Published Aug 4, 2020• 1 citation
Publisher

Abstract

In this article, a broadcast channel in the degraded state with two legitimate receivers in the attendance of an eavesdropper has been studied, where, the sender demands to forward two independent confidential messages that ought to be kept as secret as feasible of the eavesdropper to the legitimate receivers. In the studied system, it has been supposed that the non-causal channel state information has been considered at the transmitter side and every one of receivers has the message forwarded via source demanded via the further one. The model studied in this paper is further generalized into the formerly considered broadcast channel with confidential messages and considering side information in the receiver. It has been supplied an outer bound by considering confidentially conditions for proposed system.

DOI
10.1109/icee50131.2020.9260724

Related papers

Secrecy in broadcast channels with receiver side information

Rafael F. Wyrembelski, Aydin Sezgin, Holger Boche

We study secret communication for broadcast channels with two legitimate receivers and one eavesdropper. The transmitter sends two independent confidential messages to the legitimate receivers which have to be kept secret from the eavesdropper. Here, each legitimate receiver is interested in one confidential message having the other one already as side information available. This problem arises for example in the broadcast phase in a bidirectional relay network, where a relay node establishes a bidirectional communication between two nodes while keeping the communication secure from an eavesdropper outside the network. We provide achievable rate regions and an outer bound on the secrecy capacity region.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•17 citations

Inner and Outer Bounds on the Secrecy Capacity of Degraded Broadcast Channels with RMSI and Transmitter CSI

Saeid Pakravan, Mohsen Ahmadzadeh, Ghosheh Abed Hodtani

This paper studies the secrecy capacity of a class of degraded broadcast channels in the presence of an external eavesdropper, where a transmitter aims to deliver two independent confidential messages to two legitimate receivers. The transmitter is assumed to have non-causal access to the channel state information (CSI), and each legitimate receiver possesses prior knowledge of the other receiver's message, referred to as receiver message side information (RMSI). We consider two distinct scenarios: complementary RMSI, where each receiver knows only the other's message, and non-complementary RMSI, where the side information does not perfectly align. For both scenarios, we derive novel inner bounds on the achievable secrecy rate region and present tight outer bounds, establishing the secrecy capacity region for the considered degraded channel settings. Unlike prior works, which primarily address general broadcast settings without secrecy constraints or omit key interactions between RMSI and CSI, our results provide a complete characterization of the secure communication limits under these conditions. Moreover, we extend our analysis to the Gaussian degraded broadcast channel, highlighting the pivotal role of CSI in enhancing secure transmission performance. Our findings demonstrate that the combination of RMSI and CSI can be strategically leveraged to expand the secrecy capacity region, thus offering new insights into secure multiuser communication system design.

arXiv:2606.25351•Jun 24, 2026•0 citations

Semi-deterministic Broadcast Channel With Side Information: A Secrecy Capacity Outer Bound

Saeid Pakravan, Ghosheh Abed Hodtani

In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.

International Conference on Computer and Knowledge Engineering•Oct 29, 2020•2 citations

Joint and individual secrecy in broadcast channels with receiver side information

Ahmed S. Mansour, Rafael F. Schaefer, Holger Boche

We study secure communication in which two confidential messages are transmitted over a broadcast channel to two legitimate receivers, while keeping an eavesdropper ignorant. Each legitimate receiver is interested in decoding one confidential message, while having the other one as side information. In order to measure the secrecy of the communication, we investigate two different secrecy criteria: joint secrecy and individual secrecy. For both criteria, we provide an achievable rate region and a matching multi-letter outer bound presenting a multi-letter description for the capacity region. We further investigate the class of more capable channels and provide a single-letter converse establishing the secrecy capacity region, not only for more capable channels but less noisy and degraded channels as well. Our results indicate that the secrecy capacity for individual secrecy is higher than the one for joint secrecy, as one message can be used as a secret key for the other one.

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

Key agreement over a 3-receiver broadcast channel

Bahrami, Mohsen, Ali Bereyhi, Sadaf Salehkalaibar +1 more

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimate receivers while keeping it concealed from the eavesdropper. Simultaneously, the transmitter agrees on a private key with each of the legitimate receivers that needs to be kept secret from the other legitimate receiver and the eavesdropper. For this setup, we derive inner and outer bounds on the secret key capacity region. In the second setup, we assume that a backward public channel is available among the receivers and the transmitter. Each legitimate receiver wishes to share a private key with the transmitter. For this setup, an inner bound on the private key capacity region is found. Furthermore, the capacity region of the secret key in the state-dependent wiretap channel can be deduced from our inner and outer bounds.

arXiv:1301.5142•Jan 22, 2013•0 citations

On the use of secret keys in broadcast channels with receiver side information

Rafael F. Schaefer, Ashish J. Khisti, Holger Boche

The use of secret keys in broadcast channels with receiver side information is studied. The particular scenario is analyzed where a transmitter wants to send two confidential messages to two receivers, while keeping an external eavesdropper ignorant. Each receiver has one of the confidential messages as side information available for decoding. In addition to that, the transmitter shares independent secret keys of arbitrary rates with both receivers. The secret keys can be used in different ways: They can act as one-time pads to encrypt the confidential messages or they can be used as randomization resources for wiretap coding. Both approaches are discussed and an achievable rate region based on superposition coding is established for the one-time pad approach. For the wiretap coding approach, the secrecy capacity for degraded channels is derived. In the optimal coding scheme, the available secret keys are used as the randomization part of the wiretap code to keep the eavesdropper ignorant. In establishing the capacity region, a new upper bound on the sum-rate is derived. This bound shows that in an optimal coding scheme, in the degraded case, the total equivocation-rate of the (opposite) secret-keys at the legitimate receivers must equal the equivocation-rate of the secret-keys at the eavesdropper, when informed about the messages.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•2 citations
In this article, a broadcast channel in the degraded state with two legitimate receivers in the attendance of an eavesdropper has been studied, where, the sender demands to forward two independent confidential messages that ought to be kept as secret as feasible of the eavesdropper to the legitimate receivers. In the studied system, it has been supposed that the non-causal channel state information has been considered at the transmitter side and every one of receivers has the message forwarded via source demanded via the further one. The model studied in this paper is further generalized into the formerly considered broadcast channel with confidential messages and considering side information in the receiver. It has been supplied an outer bound by considering confidentially conditions for proposed system.
We study secret communication for broadcast channels with two legitimate receivers and one eavesdropper. The transmitter sends two independent confidential messages to the legitimate receivers which have to be kept secret from the eavesdropper. Here, each legitimate receiver is interested in one confidential message having the other one already as side information available. This problem arises for example in the broadcast phase in a bidirectional relay network, where a relay node establishes a bidirectional communication between two nodes while keeping the communication secure from an eavesdropper outside the network. We provide achievable rate regions and an outer bound on the secrecy capacity region.
This paper studies the secrecy capacity of a class of degraded broadcast channels in the presence of an external eavesdropper, where a transmitter aims to deliver two independent confidential messages to two legitimate receivers. The transmitter is assumed to have non-causal access to the channel state information (CSI), and each legitimate receiver possesses prior knowledge of the other receiver's message, referred to as receiver message side information (RMSI). We consider two distinct scenarios: complementary RMSI, where each receiver knows only the other's message, and non-complementary RMSI, where the side information does not perfectly align. For both scenarios, we derive novel inner bounds on the achievable secrecy rate region and present tight outer bounds, establishing the secrecy capacity region for the considered degraded channel settings. Unlike prior works, which primarily address general broadcast settings without secrecy constraints or omit key interactions between RMSI and CSI, our results provide a complete characterization of the secure communication limits under these conditions. Moreover, we extend our analysis to the Gaussian degraded broadcast channel, highlighting the pivotal role of CSI in enhancing secure transmission performance. Our findings demonstrate that the combination of RMSI and CSI can be strategically leveraged to expand the secrecy capacity region, thus offering new insights into secure multiuser communication system design.
In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.
We study secure communication in which two confidential messages are transmitted over a broadcast channel to two legitimate receivers, while keeping an eavesdropper ignorant. Each legitimate receiver is interested in decoding one confidential message, while having the other one as side information. In order to measure the secrecy of the communication, we investigate two different secrecy criteria: joint secrecy and individual secrecy. For both criteria, we provide an achievable rate region and a matching multi-letter outer bound presenting a multi-letter description for the capacity region. We further investigate the class of more capable channels and provide a single-letter converse establishing the secrecy capacity region, not only for more capable channels but less noisy and degraded channels as well. Our results indicate that the secrecy capacity for individual secrecy is higher than the one for joint secrecy, as one message can be used as a secret key for the other one.
In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimate receivers while keeping it concealed from the eavesdropper. Simultaneously, the transmitter agrees on a private key with each of the legitimate receivers that needs to be kept secret from the other legitimate receiver and the eavesdropper. For this setup, we derive inner and outer bounds on the secret key capacity region. In the second setup, we assume that a backward public channel is available among the receivers and the transmitter. Each legitimate receiver wishes to share a private key with the transmitter. For this setup, an inner bound on the private key capacity region is found. Furthermore, the capacity region of the secret key in the state-dependent wiretap channel can be deduced from our inner and outer bounds.
The use of secret keys in broadcast channels with receiver side information is studied. The particular scenario is analyzed where a transmitter wants to send two confidential messages to two receivers, while keeping an external eavesdropper ignorant. Each receiver has one of the confidential messages as side information available for decoding. In addition to that, the transmitter shares independent secret keys of arbitrary rates with both receivers. The secret keys can be used in different ways: They can act as one-time pads to encrypt the confidential messages or they can be used as randomization resources for wiretap coding. Both approaches are discussed and an achievable rate region based on superposition coding is established for the one-time pad approach. For the wiretap coding approach, the secrecy capacity for degraded channels is derived. In the optimal coding scheme, the available secret keys are used as the randomization part of the wiretap code to keep the eavesdropper ignorant. In establishing the capacity region, a new upper bound on the sum-rate is derived. This bound shows that in an optimal coding scheme, in the degraded case, the total equivocation-rate of the (opposite) secret-keys at the legitimate receivers must equal the equivocation-rate of the secret-keys at the eavesdropper, when informed about the messages.