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:1312.6784 · IEEE Transactions on Information Forensics and Security

Relay Broadcast Channel With Confidential Messages

Bin Dai, Linman Yu, Zheng Ma

Published Nov 23, 2015• 11 citations
arXivHTMLPDF

Abstract

In this paper, we investigate the effects of a trusted relay node on the secrecy of the broadcast channel by considering the model of relay broadcast channel with confidential messages (RBC-CM). Inner and outer bounds on the capacity-equivocation region of the RBC-CM are provided, and the capacity results are further explained via a degraded Gaussian example, which we call the degraded Gaussian relay broadcast channel with one common and one confidential messages. Numerical results show that this trusted relay node helps to enhance the security of the Gaussian broadcast channel with one common and one confidential messages.

DOI
10.1109/tifs.2015.2503259

Related papers

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

Capacity Results for Relay Channels with Confidential Messages

Yasutada Oohama, Shun Watanabe

We consider a communication system where a relay helps transmission of messages from {a} sender to {a} receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In this paper we study a relay channel with confidential messages(RCC), where a sender attempts to transmit common information to both a receiver and a relay and also has private information intended for the receiver and confidential to the relay. The level of secrecy of private information confidential to the relay is measured by the equivocation rate, i.e., the entropy rate of private information conditioned on channel outputs at the relay. The performance measure of interest for the RCC is the rate triple that includes the common rate, the private rate, and the equivocation rate as components. The rate-equivocation region is defined by the set that consists of all these achievable rate triples. In this paper we give two definitions of the rate-equivocation region. We first define the rate-equivocation region in the case of deterministic encoder and call it the deterministic rate-equivocation region. Next, we define the rate-equivocation region in the case of stochastic encoder and call it the stochastic rate-equivocation region. We derive explicit inner and outer bounds for the above two regions. On the deterministic/stochastic rate-equivocation region we present two classes of relay channels where inner and outer bounds match. We also evaluate the deterministic and stochastic rate-equivocation regions of the Gaussian RCC.

arXiv:1009.5829•Sep 29, 2010•8 citations

Bounds on the secrecy capacity region of the degraded multiple-access relay wiretap channel

Bin Dai, Zheng Ma, Linman Yu

In this paper, we investigate the effects of an additional trusted relay node on the secrecy of the degraded multiple-access wiretap channel (DMAC-WT) by considering the model of the degraded multiple-access relay wiretap channel (DMARC-WT). Inner and outer bounds on the secrecy capacity regions of the DMARC-WT are provided for both the discrete memoryless and the Gaussian cases. For the Gaussian DMARC-WT, we find that in some particular cases, Tekin-Yener's achievable secrecy rate region of the Gaussian DMAC-WT is enhanced by using this trusted relay node.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2015•0 citations

Privacy in Bidirectional Relay Networks

Rafael F. Wyrembelski, Holger Boche

In this work, the bidirectional broadcast channel (BBC) with confidential messages is studied. The problem is motivated by the concept of bidirectional relaying in a three-node network, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby transmits additional confidential information to one of them in the broadcast phase. The corresponding confidential message is transmitted at a certain secrecy level which characterizes the amount of information that can be kept secret from the non-legitimate node. The capacity-equivocation and secrecy capacity regions of the BBC with confidential messages are established where the latter characterizes the communication scenario with perfect secrecy, which means that the confidential information is completely hidden from the non-legitimate node. Thereby, it is shown that the optimal processing exploits ideas and concepts of the BBC with common messages and of the classical broadcast channel with confidential messages.

IEEE Transactions on Communications•Jun 1, 2012•5 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

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
In this paper, we investigate the effects of a trusted relay node on the secrecy of the broadcast channel by considering the model of relay broadcast channel with confidential messages (RBC-CM). Inner and outer bounds on the capacity-equivocation region of the RBC-CM are provided, and the capacity results are further explained via a degraded Gaussian example, which we call the degraded Gaussian relay broadcast channel with one common and one confidential messages. Numerical results show that this trusted relay node helps to enhance the security of the Gaussian broadcast channel with one common and one confidential messages.
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 consider a communication system where a relay helps transmission of messages from {a} sender to {a} receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In this paper we study a relay channel with confidential messages(RCC), where a sender attempts to transmit common information to both a receiver and a relay and also has private information intended for the receiver and confidential to the relay. The level of secrecy of private information confidential to the relay is measured by the equivocation rate, i.e., the entropy rate of private information conditioned on channel outputs at the relay. The performance measure of interest for the RCC is the rate triple that includes the common rate, the private rate, and the equivocation rate as components. The rate-equivocation region is defined by the set that consists of all these achievable rate triples. In this paper we give two definitions of the rate-equivocation region. We first define the rate-equivocation region in the case of deterministic encoder and call it the deterministic rate-equivocation region. Next, we define the rate-equivocation region in the case of stochastic encoder and call it the stochastic rate-equivocation region. We derive explicit inner and outer bounds for the above two regions. On the deterministic/stochastic rate-equivocation region we present two classes of relay channels where inner and outer bounds match. We also evaluate the deterministic and stochastic rate-equivocation regions of the Gaussian RCC.
In this paper, we investigate the effects of an additional trusted relay node on the secrecy of the degraded multiple-access wiretap channel (DMAC-WT) by considering the model of the degraded multiple-access relay wiretap channel (DMARC-WT). Inner and outer bounds on the secrecy capacity regions of the DMARC-WT are provided for both the discrete memoryless and the Gaussian cases. For the Gaussian DMARC-WT, we find that in some particular cases, Tekin-Yener's achievable secrecy rate region of the Gaussian DMAC-WT is enhanced by using this trusted relay node.
In this work, the bidirectional broadcast channel (BBC) with confidential messages is studied. The problem is motivated by the concept of bidirectional relaying in a three-node network, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby transmits additional confidential information to one of them in the broadcast phase. The corresponding confidential message is transmitted at a certain secrecy level which characterizes the amount of information that can be kept secret from the non-legitimate node. The capacity-equivocation and secrecy capacity regions of the BBC with confidential messages are established where the latter characterizes the communication scenario with perfect secrecy, which means that the confidential information is completely hidden from the non-legitimate node. Thereby, it is shown that the optimal processing exploits ideas and concepts of the BBC with common messages and of the classical broadcast channel with confidential messages.
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 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.