TY - JOUR
T1 - Cooperative encoding for secrecy in interference channels
AU - Koyluoglu, Onur Ozan
AU - El Gamal, Hesham
N1 - Funding Information: Manuscript received May 25, 2009; revised September 09, 2010; accepted March 06, 2011. Date of current version August 31, 2011. This work was supported in part by the National Science Foundation under Grant CCF-07-28762, in part by the Los Alamos National Laboratory, and in part by the Qatar National Research Fund. O. O. Koyluoglu was supported in part by the Presidential Fellowship Award of The Ohio State University. The material in this paper was presented in part at the IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Cannes, France, September 2008.
PY - 2011/9
Y1 - 2011/9
N2 - This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of cooperative encoding in which the two users cooperatively design their randomized codebooks and jointly optimize their channel prefixing distributions. Our achievability scheme also utilizes message-splitting in order to allow for partial decoding of the interference at the nonintended receiver. Outer bounds are then derived and used to establish the optimality of the proposed scheme in certain cases. In the Gaussian case, the previously proposed cooperative jamming and noise-forwarding techniques are shown to be special cases of our proposed approach. Overall, our results provide structural insights on how the interference can be exploited to increase the secrecy capacity of wireless networks.
AB - This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of cooperative encoding in which the two users cooperatively design their randomized codebooks and jointly optimize their channel prefixing distributions. Our achievability scheme also utilizes message-splitting in order to allow for partial decoding of the interference at the nonintended receiver. Outer bounds are then derived and used to establish the optimality of the proposed scheme in certain cases. In the Gaussian case, the previously proposed cooperative jamming and noise-forwarding techniques are shown to be special cases of our proposed approach. Overall, our results provide structural insights on how the interference can be exploited to increase the secrecy capacity of wireless networks.
KW - Cooperative encoding
KW - information theoretic security
KW - interference channel
UR - http://www.scopus.com/inward/record.url?scp=80052369884&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052369884&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2161928
DO - 10.1109/TIT.2011.2161928
M3 - Article
SN - 0018-9448
VL - 57
SP - 5682
EP - 5694
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 9
M1 - 6006610
ER -