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)

Improved rate-equivocation regions for secure cooperative communication

Ninoslav Marina, Hideki Yagi, H. Vincent Poor

Published Jul 1, 2011• 13 citations
Publisher

Abstract

A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver, while the eavesdropper tries to decode the transmitted message. The main result is the derivation of a newly achievable rate-equivocation region that is shown to be larger than a rate-equivocation region derived by Lai and El Gamal for the relay-eavesdropper channel. When the rate of the helping interferer is zero, the new rate-equivocation region reduces to the capacity-equivocation region over the wire-tap channel; hence, the new achievability scheme can be seen as a generalization of a coding scheme proposed by Csiszár and Körner.

DOI
10.1109/isit.2011.6034100

Related papers

Improved Rate-Equivocation Regions for Secure Cooperative Communication

Ninoslav Marina, Hideki Yagi, H. Vincent Poor

A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver, while the eavesdropper tries to decode the transmitted message. The main result is the derivation of a newly achievable rate-equivocation region that is shown to be larger than a rate-equivocation region derived by Lai and El Gamal for the relay-eavesdropper channel. When the rate of the helping interferer is zero, the new rate-equivocation region reduces to the capacity-equivocation region over the wire-tap channel, hence, the new achievability scheme can be seen as a generalization of a coding scheme proposed by Csiszar and Korner. This result can naturally be combined with a rate-equivocation region given by Tang et al. (for the interference assisted secret communication), yielding an even larger achievable rate-equivocation region.

arXiv:1102.3500•Feb 17, 2011•1 citation

A new achievable rate-equivocation region for the relay-eavesdropper channel

Amir Sonee, Somayeh Salimi

In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.

Iranian Conference on Electrical Engineering•May 1, 2010•3 citations

Generalized multiple-access relay channel with confidential messages

Amir Sonee, Somayeh Salimi, Mahmoud Salmasizadeh

In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret messages. In the second one, in addition to sending independent codewords, relay also sends compressed version of the received signals. Using these schemes, we derive the inner bounds for the capacity-equivocation region of the described model.

International Symposium on Information Theory and its Applications•Oct 1, 2010•0 citations

The Relay–Eavesdropper Channel: Cooperation for Secrecy

Lifeng Lai, Hesham El Gamal

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay–eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel noise-forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the secrecy capacity in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive white Gaussian noise (AWGN) channel.

arXiv:cs/0612044•IEEE Transactions on Information Theory•Aug 27, 2008•774 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

E - Capacity - Equivocation Region of Wiretap Channel

Mariam E. Haroutunian

One of the problems of information - theoretic security concerns secure communication over a wiretap channel. The aim in the general wiretap channel model is to maximize the rate of the reliable communication from the source to the legitimate receiver, while keeping the confidential information as secret as possible from the wiretapper (eavesdropper). We introduce and investigate the E - capacity - equivocation region and the E - secrecy capacity function for the wiretap channel, which are, correspondingly, the generalizations of the capacity - equivocation region and secrecy - capacity studied by Csiszár and Körner (1978). The E - capacity equivocation region is the closure of the set of all achievable rate - reliability and equivocation pairs, where the rate - reliability function represents the optimal dependence of rate on the error probability exponent (reliability). By analogy with the notion of E - capacity, we consider the E - secrecy capacity function that for the given E is the maximum rate at which the message can be transmitted being kept perfectly secret from the wiretapper.

JUCS - Journal of Universal Computer Science•Nov 28, 2021•1 citation
A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver, while the eavesdropper tries to decode the transmitted message. The main result is the derivation of a newly achievable rate-equivocation region that is shown to be larger than a rate-equivocation region derived by Lai and El Gamal for the relay-eavesdropper channel. When the rate of the helping interferer is zero, the new rate-equivocation region reduces to the capacity-equivocation region over the wire-tap channel; hence, the new achievability scheme can be seen as a generalization of a coding scheme proposed by Csiszár and Körner.
A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver, while the eavesdropper tries to decode the transmitted message. The main result is the derivation of a newly achievable rate-equivocation region that is shown to be larger than a rate-equivocation region derived by Lai and El Gamal for the relay-eavesdropper channel. When the rate of the helping interferer is zero, the new rate-equivocation region reduces to the capacity-equivocation region over the wire-tap channel, hence, the new achievability scheme can be seen as a generalization of a coding scheme proposed by Csiszar and Korner. This result can naturally be combined with a rate-equivocation region given by Tang et al. (for the interference assisted secret communication), yielding an even larger achievable rate-equivocation region.
In this paper, we propose an information-theoretic scheme which achieves a new rate-equivocation region for the four-terminal relay-eavesdropper channel. The coding scheme used to achieve this region is a combination of the partial decode and forward, compress and forward and noise forwarding strategies. In this strategy the relay cooperates with the source to have both a reliable and secure communication by decoding some part of the source message, compressing the received signal and also sending the codewords independent of the transmitted message. Using this scheme we can obtain the perfect secrecy capacity of the semi- deterministic and deterministic relay channels.
In this paper, we propose information theoretic schemes that achieve the rate-equivocation regions for the multiple-access relay channel with confidential messages. This channel consists of two users that play the role of eavesdropper for each other's message and a relay that helps them to have a reliable and secure communication. The relay can itself be an eavesdropper of the users messages. The first coding scheme used for achievability is noise forwarding strategy and the second is the combination of noise forwarding with the compress and forward strategy. In the first one, relay cooperates with the users to have a confidential communication by sending codewords independent of the secret messages. In the second one, in addition to sending independent codewords, relay also sends compressed version of the received signals. Using these schemes, we derive the inner bounds for the capacity-equivocation region of the described model.
This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay–eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is the novel noise-forwarding (NF) strategy, where the relay node sends codewords independent of the source message to confuse the eavesdropper. This strategy is used to illustrate the deaf helper phenomenon, where the relay is able to facilitate secure communications while being totally ignorant of the transmitted messages. Furthermore, NF is shown to increase the secrecy capacity in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting. The gain offered by the proposed cooperation strategies is then proved theoretically and validated numerically in the additive white Gaussian noise (AWGN) channel.
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.
One of the problems of information - theoretic security concerns secure communication over a wiretap channel. The aim in the general wiretap channel model is to maximize the rate of the reliable communication from the source to the legitimate receiver, while keeping the confidential information as secret as possible from the wiretapper (eavesdropper). We introduce and investigate the E - capacity - equivocation region and the E - secrecy capacity function for the wiretap channel, which are, correspondingly, the generalizations of the capacity - equivocation region and secrecy - capacity studied by Csiszár and Körner (1978). The E - capacity equivocation region is the closure of the set of all achievable rate - reliability and equivocation pairs, where the rate - reliability function represents the optimal dependence of rate on the error probability exponent (reliability). By analogy with the notion of E - capacity, we consider the E - secrecy capacity function that for the given E is the maximum rate at which the message can be transmitted being kept perfectly secret from the wiretapper.