Capacity of cognitive interference channels with and without secrecy

Authors:
Yingbin Liang;Anelia Somekh-Baruch;H. Vincent Poor;Shlomo Shamai;Sergio Verdú
Affiliations:
Department of Electrical Engineering, University of Hawaii, Honolulu, HI;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Technion-Israel Institute of Technology, Technion City, Haifa, Israel;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 13
Cited 10

Theory of linear and integer programming

Theory of linear and integer programming
Elements of information theory

Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Review of Rate Regions for Interference Channels

IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
Cognitive radio: an information-theoretic perspective

IEEE Transactions on Information Theory
On achievable rate regions for the Gaussian interference channel

IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels

IEEE Transactions on Information Theory
Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets

IEEE Transactions on Information Theory
Interference Channels With Common Information

IEEE Transactions on Information Theory
Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

IEEE Transactions on Information Theory
On The Han–Kobayashi Region for theInterference Channel

IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit

IEEE Transactions on Information Theory
Limits on communications in a cognitive radio channel

IEEE Communications Magazine

Information Theoretic Security

Foundations and Trends in Communications and Information Theory
Secrecy capacity of a class of orthogonal relay eavesdropper channels

EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
On the throughput of secure hybrid-ARQ protocols for Gaussian block-fading channels

IEEE Transactions on Information Theory
Multiaccess channels with state known to one encoder: another case of degraded message sets

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Bounds and capacity results for the cognitive Z-interference channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Information secrecy from multiple eavesdroppers in orthogonal relay channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the relationship between the multi-antenna secrecy communications and cognitive radio communications

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal MISO secrecy beamforming via quasi-convex programming with rank-one transmit covariance guarantee

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
On the relationship between the multi-antenna secrecy communications and cognitive radio communications

IEEE Transactions on Communications
On information theoretic security: mathematical models and techniques

ICITS'11 Proceedings of the 5th international conference on Information theoretic security

Quantified Score

Hi-index	754.90

Visualization

Abstract

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