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:1511.07168 · Transactions on Emerging Telecommunications Technologies

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

Hamid G. Bafghi, Babak Seyfe, Mahtab Mirmohseni, Mohammad Reza Aref

Published Aug 3, 2016• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1002/ett.3075

Related papers

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

Cognitive interference channel with two confidential messages

Hamid G. Bafghi, Somayeh Salimi, Babak Seyfe +1 more

In this paper we consider a cognitive interference channel with two confidential messages. In our scenario, although the cognitive transmitter cooperates with the primary sender, the primary and cognitive messages must be secure at unintended receivers. The level of secrecy is measured by the equivocation rate. Also an expression is obtained for the rate-equivocation region of the discrete memoryless cognitive interference channel with confidential primary and secondary messages.

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

Capacity theorems for the Cognitive Radio Channel with confidential messages

Reza K. Farsani, Reza Ebrahimpour

In this paper, capacity limits are explored for the Cognitive Radio Channel (CRC) with confidential messages. As an idealized information theoretic model for the cognitive radio, this channel includes two transmitters which send independent messages to their corresponding receivers such that one transmitter, i.e., the cognitive transmitter, has access non-causally to the message of the other transmitter, i.e., the primary transmitter. The message designated to each receiver is required to be kept confidential with respect to the other receiver. The secrecy level for each message is evaluated using the equivocation rate. Novel inner and outer bounds for the capacity-equivocation region are established. It is shown that these bounds coincide for some special cases. Specifically, the capacity-equivocation region is derived for a class of less-noisy CRCs and also a class of semi-deterministic CRCs. For the case where only the message of the cognitive transmitter is required to be kept confidential, the capacity-equivocation region is also established for the Gaussian CRC with weak interference.

arXiv:1207.5040•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•8 citations

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

aghigh aghajanzade, Bahareh Akhbari, arash kakaee

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.

Journal of Communication Engineering•Jun 1, 2018•0 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•33 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•183 citations
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.
In this paper, capacity limits are explored for the Cognitive Radio Channel (CRC) with confidential messages. As an idealized information theoretic model for the cognitive radio, this channel includes two transmitters which send independent messages to their corresponding receivers such that one transmitter, i.e., the cognitive transmitter, has access non-causally to the message of the other transmitter, i.e., the primary transmitter. The message designated to each receiver is required to be kept confidential with respect to the other receiver. The secrecy level for each message is evaluated using the equivocation rate. Novel inner and outer bounds for the capacity-equivocation region are established. It is shown that these bounds coincide for some special cases. Specifically, the capacity-equivocation region is derived for a class of less-noisy CRCs and also a class of semi-deterministic CRCs. For the case where only the message of the cognitive transmitter is required to be kept confidential, the capacity-equivocation region is also established for the Gaussian CRC with weak interference.
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.
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.