On The Secrecy of the Cognitive Interference Channel with Partial Channel States

TL;DR

This paper investigates the secrecy capacity of a state-dependent cognitive interference channel with partial channel state information, deriving achievable regions and outer bounds, including Gaussian case extensions.

Contribution

It introduces new achievable equivocation-rate regions for the secrecy problem in the cognitive interference channel with partial state information.

Findings

Derived achievable equivocation-rate regions using binning and superposition coding.

Proposed outer bounds on the capacity of the channel.

Extended results to Gaussian channel models.

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 a channel state sequence which is estimated partially at the cognitive transmitter and the corresponding receiver. The cognitive transmitter wishes to cooperate with the primary one, and it sends its individual message which should be confidential 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 the outer bounds on the capacity are proposed and the results are extended to the Gaussian examples.