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

arXiv:1609.06353 · IEEE Information Theory Workshop (ITW)

Degraded broadcast channel: Secrecy outside of a bounded range

Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shitz Shamai

Published Apr 1, 2015• 9 citations
arXivHTMLPDF

Abstract

A three-receiver degraded broadcast channel with secrecy outside of a bounded range is studied, in which the channel quality gradually degrades from receiver 3 to receiver 1. The transmitter has three messages intended for the receivers with receiver 3 decoding all messages, receiver 2 decoding the first two messages, and receiver 1 decoding only the first message. Furthermore, the third message should be kept secure from receiver 1. The discrete memoryless channel is studied and the secrecy capacity region is characterized. The achievable scheme is based on superposition coding and random binning, in which one superposition layer and random binning together provide secrecy. The converse proof is derived based on the insight obtained from the achievable scheme so that manipulations of terms yield tight rate bounds.

DOI
10.1109/itw.2015.7133081

Related papers

K-user degraded broadcast channel with secrecy outside a bounded range

Shaofeng Zou, Yingbin Liang, Lifeng Lai +2 more

A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, …, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wkshould be kept secure from receivers with two-level worse channel quality, i.e., receivers 1, …, k − 2. The secrecy capacity region is fully characterized. The achievable scheme designates one superposition layer to each message with random binning employed for each layer for protecting all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can potentially be shared with its immediate upper-layer message to enlarge the rate region. More importantly, an induction approach is developed to perform Fourier-Motzkin elimination over 2K variables among Θ(K2) bounds to obtain a close-form achievable rate region. A converse proof is developed that matches the achievable rate region, which involves recursive construction of the rate bounds.

IEEE Information Theory Workshop (ITW)•Sep 1, 2016•1 citation

Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range

Shaofeng Zou, Yingbin Liang, Lifeng Lai +1 more

A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1, …, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2015•8 citations

Layered decoding and secrecy over degraded broadcast channels

Shaofeng Zou, Yingbin Liang, Lifeng Lai +1 more

A K-receiver degraded broadcast channel with layered decoding and secrecy constraints is investigated, in which receivers are ordered by their channel quality. Each receiver is required to decode one more message compared to the receiver with one level worse channel quality, and this message should be kept secure from all receivers with worse channel quality. For both the discrete memoryless channel and the Gaussian channel, the secrecy capacity region is characterized. The achievability scheme is based on stochastic encoding and superposition coding schemes. Novel generalization of the analysis of leakage rates and of the proof of the converse is developed for the K-receiver scenario.

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

Gaussian fading channel with secrecy outside a bounded range

Shaofeng Zou, Yingbin Liang, Shlomo Shitz Shamai

The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state is better, then more information is required to be decoded by the receiver, and if the channel state is worse, more information is required to be secure from the receiver. Furthermore, the information intended to be decoded by the receiver with a better state (e.g., |H| ≥ |h0|) is required to be secure from the receiver if it has a state worse than |h0| by Δ (i.e., |H| ≤ |h0| — Δ), which is referred to as secrecy outside a bounded range. A (layered) broadcast approach is studied for this problem, which views the fading channel as a degraded broadcast channel with a number of receivers each experiencing a different fading coefficient. The achievable scheme designates one superposition layer to each message with binning employed to protect all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can be shared with its upper-layer messages to enlarge the rate region. The achievable secrecy rate region via the broadcast approach is characterized. The developed scheme can adapt the transmission rate to the actual unknown channel state without exploiting the CSI at the transmitter.

IEEE Conference on Communications and Network Security•Oct 1, 2017•1 citation

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•16 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
A three-receiver degraded broadcast channel with secrecy outside of a bounded range is studied, in which the channel quality gradually degrades from receiver 3 to receiver 1. The transmitter has three messages intended for the receivers with receiver 3 decoding all messages, receiver 2 decoding the first two messages, and receiver 1 decoding only the first message. Furthermore, the third message should be kept secure from receiver 1. The discrete memoryless channel is studied and the secrecy capacity region is characterized. The achievable scheme is based on superposition coding and random binning, in which one superposition layer and random binning together provide secrecy. The converse proof is derived based on the insight obtained from the achievable scheme so that manipulations of terms yield tight rate bounds.
A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, …, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wkshould be kept secure from receivers with two-level worse channel quality, i.e., receivers 1, …, k − 2. The secrecy capacity region is fully characterized. The achievable scheme designates one superposition layer to each message with random binning employed for each layer for protecting all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can potentially be shared with its immediate upper-layer message to enlarge the rate region. More importantly, an induction approach is developed to perform Fourier-Motzkin elimination over 2K variables among Θ(K2) bounds to obtain a close-form achievable rate region. A converse proof is developed that matches the achievable rate region, which involves recursive construction of the rate bounds.
A four-receiver degraded broadcast channel with secrecy outside a bounded range is studied, over which a transmitter sends four messages to four receivers. In the model considered, the channel quality gradually degrades from receiver 4 to receiver 1, and receiver k is required to decode the first k messages for k = 1, …, 4. Furthermore, message 3 is required to be secured from receiver 1, and message 4 is required to be secured from receivers 1 and 2. The secrecy capacity region is established. The achievable scheme includes not only superposition, binning and embedded coding used in previous studies, but also rate splitting and sharing particularly designed for this model, which is shown to be critical to further enlarge the achievable region and enable the development of the converse proof.
A K-receiver degraded broadcast channel with layered decoding and secrecy constraints is investigated, in which receivers are ordered by their channel quality. Each receiver is required to decode one more message compared to the receiver with one level worse channel quality, and this message should be kept secure from all receivers with worse channel quality. For both the discrete memoryless channel and the Gaussian channel, the secrecy capacity region is characterized. The achievability scheme is based on stochastic encoding and superposition coding schemes. Novel generalization of the analysis of leakage rates and of the proof of the converse is developed for the K-receiver scenario.
The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state is better, then more information is required to be decoded by the receiver, and if the channel state is worse, more information is required to be secure from the receiver. Furthermore, the information intended to be decoded by the receiver with a better state (e.g., |H| ≥ |h0|) is required to be secure from the receiver if it has a state worse than |h0| by Δ (i.e., |H| ≤ |h0| — Δ), which is referred to as secrecy outside a bounded range. A (layered) broadcast approach is studied for this problem, which views the fading channel as a degraded broadcast channel with a number of receivers each experiencing a different fading coefficient. The achievable scheme designates one superposition layer to each message with binning employed to protect all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can be shared with its upper-layer messages to enlarge the rate region. The achievable secrecy rate region via the broadcast approach is characterized. The developed scheme can adapt the transmission rate to the actual unknown channel state without exploiting the CSI at the transmitter.
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.
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.