Name:
entropy-21-01092-v2.pdf
Size:
1.683Mb
Format:
PDF
Description:
Final Published Version
Affiliation
Univ Arizona, Dept Elect & Comp EngnIssue Date
2019-11-07Keywords
interference channelsecure retrospective interference alignment
secure degrees of freedom (SDoF)
delayed CSIT
Metadata
Show full item recordPublisher
MDPICitation
Seif, M.; Tandon, R.; Li, M. Secure Retrospective Interference Alignment. Entropy 2019, 21, 1092.Journal
ENTROPYRights
Copyright © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
In this paper, the K-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the transmitters carefully mix information symbols with artificial noises to ensure confidentiality. Achieving positive secure degrees of freedom (SDoF) is challenging due to the delayed nature of CSIT, and the distributed nature of the transmitters. Our scheme works over two phases: Phase one, in which each transmitter sends information symbols mixed with artificial noises, and repeats such transmission over multiple rounds. In the next phase, each transmitter uses the delayed CSIT of the previous phase and sends a function of the net interference and artificial noises (generated in previous phase), which is simultaneously useful for all receivers. These phases are designed to ensure the decodability of the desired messages while satisfying the secrecy constraints. We present our achievable scheme for three models, namely: (1) K-user interference channel with confidential messages (IC-CM), and we show that 1/2(root K-6)SDoF is achievable; (2) K-user interference channel with an external eavesdropper (IC-EE); and (3) K-user IC with confidential messages and an external eavesdropper (IC-CM-EE). We show that for the K-user IC-EE, 1/2(root K-3)SDoF is achievable, and for the K-user IC-CM-EE, 1/2(root K-6)is achievable. To the best of our knowledge, this is the first result on the K-user interference channel with secrecy constrained models and delayed CSIT that achieves an SDoF which scales with root K, square-root of number of users.Note
Open access journalISSN
1099-4300Version
Final published versionSponsors
U.S. National Science Foundation (NSF) [CCF-1559758, CNS-1715947, CNS-1564477]; ONR YIP grant [N00014-16-1-2650]ae974a485f413a2113503eed53cd6c53
10.3390/e21111092
Scopus Count
Collections
Except where otherwise noted, this item's license is described as Copyright © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).