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

Journal of Communication Engineering

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

aghigh aghajanzade, Bahareh Akhbari, arash kakaee

Published Jun 1, 2018• 0 citations
Publisher

Abstract

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wiretap coding at the cognitive encoder. We use rate splitting for messages at both transmitters. Furthermore, the cognitive user compresses its channel observation using Wyner-Ziv coding and splits the index of its compressed signal. By using this scheme we derive an achievable secrecy rate region for this channel and extend the results to the Gaussian case and provide some numerical results.

DOI
10.22070/jce.2018.2650.1060

Related papers

On the secrecy of the cognitive interference channel with partial channel states

Hamid G. Bafghi, Babak Seyfe, Mahtab Mirmohseni +1 more

Abstract The secrecy problem in the state‐dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation‐rate regions for this channel are derived using two approaches: the binning scheme coding and superposition coding. Then, comparisons between the results using two coding approaches, in Gaussian case, shows that there is a trade‐off between the achievable rate of the primary transmitter and the equivocation rate of the cognitive one. Moreover, the outer bounds on the capacity of the channel are derived. Copyright © 2016 John Wiley & Sons, Ltd.

arXiv:1511.07168•Transactions on Emerging Telecommunications Technologies•Aug 3, 2016•4 citations

On The Secrecy of the Cognitive Interference Channel with Channel State

Hamid G. Bafghi, Babak Seyfe

In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. So, the cognitive encoder uses this side information to cooperate with the primary transmitter and sends its individual message confidentially. An achievable rate region and an outer bound for the rate region in this channel are derived. The results are extended to the previous works as special cases.

arXiv:1208.4469•Journal of Communication Engineering•Aug 22, 2012•2 citations

The causal cognitive interference channel

Shraga I. Bross, Yossef Steinberg, Stephan Tinguely

The (non-causal) cognitive interference channel, studied recently by Liang et.al., is a model for a classical twouser discrete memoryless interference channel, over which two transmitters send a pair of independent messages.It is assumed that the first message is shared by both encoders, whereas the second message in known only to Encoder 2 -the cognitive transmitter.Receiver 2 needs to decode both messages, and Receiver 1 should decode only the first message while Message 2 should be kept as secret as possible from Receiver 1.The level of secrecy is measured by the equivocation rate.For this model the capacity-equivocation region has been derived by Liang et.al..In this work we dispense of the assumption that Message 1 is shared a-priori by both encoders.Instead, we study the case in which Encoder 2 cribs causally from Encoder 1.We derive an achievable rate-equivocation region for this model and establish the capacity-equivocation region for a degraded interference channel.

•Jan 1, 2010•5 citations

Cognitive Interference Channels with Confidential Messages

Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor +2 more

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two receivers. It is assumed that there is a common message source (message 1) known to both transmitters, and an additional independent message source (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode both messages, while the non-cognitive receiver (receiver 1) should decode only the common message. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. A single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is established and is further explicitly derived for the Gaussian case. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, establishes a new capacity theorem for a class of interference channels, by providing a converse theorem.

arXiv:0710.2018•Oct 10, 2007•32 citations

Capacity of Cognitive Interference Channels With and Without Secrecy

Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor +2 more

Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode messages 1 and 2, while the non cognitive receiver (receiver 1) should decode only message 1. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. In this paper, a single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is obtained. The capacity-equivocation region for the Gaussian cognitive interference channel is also obtained explicitly. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, the capacity region for the two-user cognitive interference channel is obtained, by providing a converse theorem.

IEEE Transactions on Information Theory•Feb 1, 2009•177 citations

On Strong Secrecy for Multiple Access Channels With States and Causal CSI

Yiqi Chen, Tobias J. Oechtering, Mikael Skoglund +1 more

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states, and the channel state information (CSI) is revealed to the encoders in a causal manner. The main results of this paper are inner and outer bounds of the capacity region, for which we investigate coding schemes incorporating wiretap coding and secret key agreements between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are proposed. The first is a new coding scheme that uses backward decoding and the Wyner-Ziv coding, and the secret key is constructed from a lossy description of the CSI. The other is an extended version of an existing coding scheme for point-to-point wiretap channels with causal CSI. A numerical example shows that the achievable region given by the first coding scheme can be strictly larger than the second one. However, these two schemes do not outperform each other in general, and there exist some numerical examples in which each coding scheme achieves some rate pairs that cannot be achieved by another scheme. Our established inner bound reduces to some best-known results in the literature as special cases. We further investigate some capacity-achieving cases for state-dependent multiple access wiretap channels (SD-MAWCs) with degraded message sets. It turns out that the two coding schemes are both optimal in these cases.

arXiv:2306.14323•IEEE Transactions on Information Theory•Jan 29, 2025•1 citation
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wiretap coding at the cognitive encoder. We use rate splitting for messages at both transmitters. Furthermore, the cognitive user compresses its channel observation using Wyner-Ziv coding and splits the index of its compressed signal. By using this scheme we derive an achievable secrecy rate region for this channel and extend the results to the Gaussian case and provide some numerical results.
Abstract The secrecy problem in the state‐dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation‐rate regions for this channel are derived using two approaches: the binning scheme coding and superposition coding. Then, comparisons between the results using two coding approaches, in Gaussian case, shows that there is a trade‐off between the achievable rate of the primary transmitter and the equivocation rate of the cognitive one. Moreover, the outer bounds on the capacity of the channel are derived. Copyright © 2016 John Wiley & Sons, Ltd.
In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. So, the cognitive encoder uses this side information to cooperate with the primary transmitter and sends its individual message confidentially. An achievable rate region and an outer bound for the rate region in this channel are derived. The results are extended to the previous works as special cases.
The (non-causal) cognitive interference channel, studied recently by Liang et.al., is a model for a classical twouser discrete memoryless interference channel, over which two transmitters send a pair of independent messages.It is assumed that the first message is shared by both encoders, whereas the second message in known only to Encoder 2 -the cognitive transmitter.Receiver 2 needs to decode both messages, and Receiver 1 should decode only the first message while Message 2 should be kept as secret as possible from Receiver 1.The level of secrecy is measured by the equivocation rate.For this model the capacity-equivocation region has been derived by Liang et.al..In this work we dispense of the assumption that Message 1 is shared a-priori by both encoders.Instead, we study the case in which Encoder 2 cribs causally from Encoder 1.We derive an achievable rate-equivocation region for this model and establish the capacity-equivocation region for a degraded interference channel.
The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two receivers. It is assumed that there is a common message source (message 1) known to both transmitters, and an additional independent message source (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode both messages, while the non-cognitive receiver (receiver 1) should decode only the common message. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. A single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is established and is further explicitly derived for the Gaussian case. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, establishes a new capacity theorem for a class of interference channels, by providing a converse theorem.
Like the conventional two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at two receivers. It is assumed that there is a common message (message 1) known to both transmitters, and an additional independent message (message 2) known only to the cognitive transmitter (transmitter 2). The cognitive receiver (receiver 2) needs to decode messages 1 and 2, while the non cognitive receiver (receiver 1) should decode only message 1. Furthermore, message 2 is assumed to be a confidential message which needs to be kept as secret as possible from receiver 1, which is viewed as an eavesdropper with regard to message 2. The level of secrecy is measured by the equivocation rate. In this paper, a single-letter expression for the capacity-equivocation region of the discrete memoryless cognitive interference channel is obtained. The capacity-equivocation region for the Gaussian cognitive interference channel is also obtained explicitly. Moreover, particularizing the capacity-equivocation region to the case without a secrecy constraint, the capacity region for the two-user cognitive interference channel is obtained, by providing a converse theorem.
Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states, and the channel state information (CSI) is revealed to the encoders in a causal manner. The main results of this paper are inner and outer bounds of the capacity region, for which we investigate coding schemes incorporating wiretap coding and secret key agreements between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are proposed. The first is a new coding scheme that uses backward decoding and the Wyner-Ziv coding, and the secret key is constructed from a lossy description of the CSI. The other is an extended version of an existing coding scheme for point-to-point wiretap channels with causal CSI. A numerical example shows that the achievable region given by the first coding scheme can be strictly larger than the second one. However, these two schemes do not outperform each other in general, and there exist some numerical examples in which each coding scheme achieves some rate pairs that cannot be achieved by another scheme. Our established inner bound reduces to some best-known results in the literature as special cases. We further investigate some capacity-achieving cases for state-dependent multiple access wiretap channels (SD-MAWCs) with degraded message sets. It turns out that the two coding schemes are both optimal in these cases.