Competition in interference channels is modeled using noncooperative game theory. The well known Nash equilibrium often leads to inefficient solutions. In the current work, we study the achievable secrecy rate of a multiple-antenna (MISO) interference channel (IFC). First, we characterize the Pareto boundary of the secrecy rate region. Next, the parameterization is exploited to compute the Nash...

We consider a Shannon cipher system for memoryless sources, in which distortion is allowed at the legitimate decoder. The source is compressed using a rate distortion code secured by a shared key, which satisfies a constraint on the compression rate, as well as a constraint on the exponential rate of the excess-distortion probability at the legitimate decoder. Secrecy is measured by the exponen...

!"#$$%" &'()*(a b Contributions • new inner bound (largest region) • new outer bound (not tightest, but computable) • capacity for deterministic channels (also semi-deterministic) • 1.8 bit gap result for Gaussian channels (preliminary simulations show smaller gap) Tx 1 Tx 2 Rx 1 Rx 2 [2] A. Avestimehr, S. Diggavi, and D. Tse, " A deterministic model for wireless relay networks an its capacity,...

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel ...

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user’s data bits, time sharing, and transmission of random bits, depending on the rate...

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this m...

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 co...

In this paper, we study the problem of secure communication over the broadcast channel with receiver side information, under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). Several coding schemes are proposed by extending known results in broadcast channels to this secrecy setting. In particular, individual secrecy p...

The rate regions of many variations of the standard and wire-tap channels have been thoroughly explored. Secrecy capacity characterizes the loss of rate required to ensure that the adversary gains no information about the transmissions. Authentication does not have a standard metric, despite being an important counterpart to secrecy. While some results have taken an information-theoretic approa...

In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. The achievable schemes for the deterministic ...