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)

Cooperative broadcast channels with a secret message

Ziv Goldfeld, Gerhard G. Kramer, Haim Henri Permuter

Published Jun 1, 2015• 2 citations
Publisher

Abstract

The broadcast channel (BC) with one confidential message and where the decoders cooperate via a one-sided link is considered. A pair of messages is transmitted, one message for each user. The message to the cooperative user is confidential and is kept secret from the cooperation-aided user. The secrecy level is measured by the equivocation rate. An inner bound on the secrecy-capacity region of the BC is derived. The inner bound is achieved by double-binning the codebook of the secret message. The inner bound is tight for the semi-deterministic (SD) and physically degraded (PD) cases. The secrecy results are compared to those of the corresponding BCs without a secrecy constraint. A cooperative Blackwell channel example illustrates the impact of secrecy on the rate regions.

DOI
10.1109/isit.2015.7282674

Related papers

Strong Secrecy for Cooperative Broadcast Channels

Ziv Goldfeld, Gerhard G. Kramer, Haim Henri Permuter +1 more

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for semideterministic and physically degraded BCs, and the results are compared with those of the corresponding BCs without a secrecy constraint. Black well and Gaussian BC examples illustrate the impact of secrecy on the rate regions. Unlike the case without secrecy, where sharing information about both private messages via the cooperative link is optimal, our protocol conveys parts of the common and non-confidential messages only. This restriction reduces the transmission rates more than the usual rate loss due to secrecy requirements. An example that illustrates this loss is provided.

arXiv:1601.01286•IEEE Transactions on Information Theory•Nov 1, 2016•22 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

Secret communication on the Z-Channel with cooperative receivers

Fayed Abdallah, Tamer M. Khattab, Lifeng Lai

The discrete memoryless Z-Channel with a confidential message and a cooperative receiver (DM-ZC-CMCR) is considered. A noiseless one-sided rate-limited cooperation link exists between the two receivers. The secrecy level is measured by the equivocation rate. An outer bound on the secrecy-capacity-region DM-ZC-CMCR is derived. An achievable secrecy-rate region is proposed. The secrecy-sum capacity of a class of physically degraded DM-ZC-CMCR is characterized. An outer bound on the secrecy-capacity region for the physically degraded-Gaussian-ZC-CMCR (PD-Gaussian-ZC-CMCR) is derived. The secrecy-sum capacity for a class of physically degraded Gaussian-ZC-CMCR is characterized.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2016•3 citations

Relay Broadcast Channels with Confidential Messages.

Bin Dai, Zheng Ma

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the capacity-equivocation region are provided. Removing the secrecy constraint, this outer bound can also be served as a new outer bound for the relay broadcast channel. Second, we investigate the discrete memoryless relay broadcast channels with two confidential messages (no common message). Inner and outer bounds on the capacity-equivocation region are provided. Then, we study the Gaussian case, and find that with the help of the relay node, the achievable secrecy rate region of the Gaussian broadcast channels with two confidential messages is enhanced. Finally, we investigate the discrete memoryless relay broadcast channels with one confidential message and one common message. This work generalizes Lai-Gamals work on the relay-eavesdropper channel by considering an additional common message for both the legitimate receiver and the eavesdropper. Inner and outer bounds on the capacity-equivocation region are provided, and the results are further explained via a Gaussian example. Compared with Csiszár-Körner’s work on broadcast channels with confidential messages (BCC), we find that with the help of the relay node, the secrecy capacity region of the Gaussian BCC is enhanced.

•Dec 24, 2013•0 citations

Random Coding Bound for Secrecy E-capacity Region of the Broadcast Channel With Two Confidential Messages

Nasrin Afshar, Evgueni Haroutunian, Mariam E. Haroutunian

We study secrecy E-capacity region of the discrete memoryless broadcast channel with two independent confidential messages sent to two receivers (BC-2CM). The system involves two sources, one encoder, two discrete memoryless channels and two receivers. Each private message is sent to the corresponding receiver while keeping the other receiver in total ignorance of it. The level of ignorance is measured by the equivocation rate. E-capacity region is the set of rate pairs R1; R2 of codes with given error probability exponents (reliabilities) E1; E2 at respective receivers. We derived a random coding bound for secrecy E-capacity region of the BC-2CM. When error probability exponents are going to zero, this bound coincides with the inner bound of secrecy capacity region of the BC-2CM obtained by R. Liu, I. Maric, P. Spasojevic and R. Yates.

Mathematical Problems of Computer Science•Apr 25, 2012•0 citations

Three-Receiver Broadcast Channels With Common and Confidential Messages

Yeow-Khiang Chia, Abbas El Gamal

This paper establishes inner bounds on the secrecy capacity regions for the general three-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.

IEEE Transactions on Information Theory•Jan 31, 2012•64 citations
The broadcast channel (BC) with one confidential message and where the decoders cooperate via a one-sided link is considered. A pair of messages is transmitted, one message for each user. The message to the cooperative user is confidential and is kept secret from the cooperation-aided user. The secrecy level is measured by the equivocation rate. An inner bound on the secrecy-capacity region of the BC is derived. The inner bound is achieved by double-binning the codebook of the secret message. The inner bound is tight for the semi-deterministic (SD) and physically degraded (PD) cases. The secrecy results are compared to those of the corresponding BCs without a secrecy constraint. A cooperative Blackwell channel example illustrates the impact of secrecy on the rate regions.
A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for semideterministic and physically degraded BCs, and the results are compared with those of the corresponding BCs without a secrecy constraint. Black well and Gaussian BC examples illustrate the impact of secrecy on the rate regions. Unlike the case without secrecy, where sharing information about both private messages via the cooperative link is optimal, our protocol conveys parts of the common and non-confidential messages only. This restriction reduces the transmission rates more than the usual rate loss due to secrecy requirements. An example that illustrates this loss is provided.
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.
The discrete memoryless Z-Channel with a confidential message and a cooperative receiver (DM-ZC-CMCR) is considered. A noiseless one-sided rate-limited cooperation link exists between the two receivers. The secrecy level is measured by the equivocation rate. An outer bound on the secrecy-capacity-region DM-ZC-CMCR is derived. An achievable secrecy-rate region is proposed. The secrecy-sum capacity of a class of physically degraded DM-ZC-CMCR is characterized. An outer bound on the secrecy-capacity region for the physically degraded-Gaussian-ZC-CMCR (PD-Gaussian-ZC-CMCR) is derived. The secrecy-sum capacity for a class of physically degraded Gaussian-ZC-CMCR is characterized.
We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the capacity-equivocation region are provided. Removing the secrecy constraint, this outer bound can also be served as a new outer bound for the relay broadcast channel. Second, we investigate the discrete memoryless relay broadcast channels with two confidential messages (no common message). Inner and outer bounds on the capacity-equivocation region are provided. Then, we study the Gaussian case, and find that with the help of the relay node, the achievable secrecy rate region of the Gaussian broadcast channels with two confidential messages is enhanced. Finally, we investigate the discrete memoryless relay broadcast channels with one confidential message and one common message. This work generalizes Lai-Gamals work on the relay-eavesdropper channel by considering an additional common message for both the legitimate receiver and the eavesdropper. Inner and outer bounds on the capacity-equivocation region are provided, and the results are further explained via a Gaussian example. Compared with Csiszár-Körner’s work on broadcast channels with confidential messages (BCC), we find that with the help of the relay node, the secrecy capacity region of the Gaussian BCC is enhanced.
We study secrecy E-capacity region of the discrete memoryless broadcast channel with two independent confidential messages sent to two receivers (BC-2CM). The system involves two sources, one encoder, two discrete memoryless channels and two receivers. Each private message is sent to the corresponding receiver while keeping the other receiver in total ignorance of it. The level of ignorance is measured by the equivocation rate. E-capacity region is the set of rate pairs R1; R2 of codes with given error probability exponents (reliabilities) E1; E2 at respective receivers. We derived a random coding bound for secrecy E-capacity region of the BC-2CM. When error probability exponents are going to zero, this bound coincides with the inner bound of secrecy capacity region of the BC-2CM obtained by R. Liu, I. Maric, P. Spasojevic and R. Yates.
This paper establishes inner bounds on the secrecy capacity regions for the general three-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be sent to two receivers and kept secret from the third receiver. Achievability is established using indirect decoding, Wyner wiretap channel coding, and the new idea of generating secrecy from a publicly available superposition codebook. The inner bound is shown to be tight for a class of reversely degraded broadcast channels and when both legitimate receivers are less noisy than the third receiver. The second setup investigated in this paper is when the confidential message is to be sent to one receiver and kept secret from the other two receivers. Achievability in this case follows from Wyner wiretap channel coding and indirect decoding. This inner bound is also shown to be tight for several special cases.