Achieving Full Secure Degrees-of-Freedom for the MISO Wiretap Channel With an Unknown Eavesdropper

被引:7
|
作者
Chraiti, Mohaned [1 ]
Ghrayeb, Ali [2 ]
Assi, Chadi [3 ]
机构
[1] Concordia Univ, ECE Dept, Montreal, PQ H3G 1M8, Canada
[2] Texas A&M Univ Qatar, ECE Dept, Doha, Qatar
[3] Concordia Univ, CIISE Dept, Montreal, PQ H3G 1M8, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
MISO wiretap channel; physical layer security; secure degrees-of-freedom; strong secrecy; unknown eavesdropper; TAP CHANNEL; SECRECY;
D O I
10.1109/TWC.2017.2738638
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we study the achievable secure degrees-of-freedom (sdof) for the multiple-input single-output (MISO) wiretap channel with an unknown eavesdropper. It is assumed that the eavesdropper's (Eve's) channel state information (CSI) is unknown to the transmitter (Alice) and legitimate receiver (Bob). Recent studies have shown that the achievable sdof in the sense of strong secrecy is zero when Eve's number of antennas is equal to or more than Bob's number of antennas, which is the scenario considered in this paper. To this end, we propose a novel precoding technique and a coding strategy that together achieve full sdof in the sense of strong secrecy without knowing Eve's CSI and without using artificial noise. The proposed precoding method uses the CSI of the Alice-Bob channel in a nonlinear fashion, which makes the transmitted symbols undecodable at Eve. The proposed coding scheme is based on the channel resolvability concept and ensures strong secrecy. Achieving full sdof with an unknown Eve's CSI is significant, because it is contrary to what is believed about the achievable sdof for the MISO wiretap channel in the sense of strong secrecy. We also show that the proposed scheme achieves near Alice-Bob's channel capacity in the sense of strong secrecy with a probability approaching one at finite signal-to-noise ratio.
引用
收藏
页码:7066 / 7079
页数:14
相关论文
共 50 条
  • [1] Achieving Full Secure Degrees-of-Freedom for the MISO Wiretap Channel with an Unknown Eavesdropper
    Chraiti, Mohaned
    Ghrayeb, Ali
    Assi, Chadi
    2016 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2016, : 997 - 1001
  • [2] Secure Degrees of Freedom of the Multiple Access Wiretap Channel with No Eavesdropper CSI
    Mukherjee, Pritam
    Ulukus, Sennur
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2311 - 2315
  • [3] Secure Degrees of Freedom of the Gaussian Wiretap Channel with Helpers and No Eavesdropper CSI: Blind Cooperative Jamming
    Xie, Jianwei
    Ulukus, Sennur
    2013 47TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2013,
  • [4] Secure Degrees of Freedom of the Interference Channel with No Eavesdropper CSI
    Mukherjee, Pritam
    Ulukus, Sennur
    2015 IEEE INFORMATION THEORY WORKSHOP - FALL (ITW), 2015, : 317 - 321
  • [5] Secure Degrees of Freedom of the Gaussian Wiretap Channel with Helpers
    Xie, Jianwei
    Ulukus, Sennur
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 193 - 200
  • [6] MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom
    He, Xiang
    Khisti, Ashish
    Yener, Aylin
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (01) : 246 - 255
  • [7] Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
    Mukherjee, Pritam
    Ulukus, Sennur
    2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2015, : 554 - 558
  • [8] Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel
    Lee, Si-Hyeon
    Zhao, Wanyao
    Khisti, Ashish
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (01) : 496 - 508
  • [9] Secure Degrees of Freedom of the Gaussian Multiple Access Wiretap Channel
    Xie, Jianwei
    Ulukus, Sennur
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1337 - 1341
  • [10] Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel
    Lee, Si-Hyeon
    Zhao, Wanyao
    Khisti, Ashish
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2819 - 2823