Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1411.2463

Polar Coding for Secure Transmission in MISO Fading Wiretap Channels

Mengfan Zheng, Meixia Tao, Wen Chen

Published Nov 10, 2014• 6 citations
arXivHTMLPDF

Abstract

In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper channel state information (CSI) and the case of fading channels with known eavesdropper channel distribution information (CDI). We use the artificial noise assisted secure precoding method to maximize the secrecy capacity in the first case, and to overcome the unawareness of the eavesdropper CSI in the second case. We show that our proposed scheme can provide both reliable and secure communication over the MISOSE channel with low encoding and decoding complexity.

DOI
10.48550/arxiv.1411.2463

Related papers

Achieving secrecy capacity of MISO fading wiretap channels with artificial noise

Qi Xiong, Yi Gong, Ying‐Chang Liang

Physical layer security in wireless networks has received increasing attention in recent years. In this paper, we consider multiple-input single-output (MISO) fading wiretap channels, where the transmitter utilizes artificial noise-aided precoding (ANaP) transmission strategy to maximize the secrecy capacity of the channel. When the channel state information (CSI) of Eavesdropper's (Eve's) channel is known at Alice, we prove that the optimal ANaP strategy reduces to the conventional precoding strategy, i.e., all the transmit power should be allocated to the precoding of information signal. When the CSI of Eve's channel is unknown at Alice, we find that there exists an optimal power allocation ratio between the information signal and the artificial noise and that this power ratio depends on the number of antennas as well as the available transmit power at Alice. In particular, when the available transmit power at Alice increases or the number of antennas at Alice decreases, more power should be allocated to the artificial noise.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•6 citations

On secure beamforming for wiretap channels with partial channel state information at the transmitter

Pin-Hsun Lin, Shih‐Chun Lin, Szu-Hsiang Lai +1 more

In this paper, we consider the secure transmission in ergodic fast fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels with only the statistics of eavesdropper's channel state information at the transmitter (CSIT). Two kinds of the legitimate CSIT are assumed, that is, full and statistical legitimate CSIT. With full legitimate CSIT, we generalize and optimize the previously proposed artificial noise (AN) aided secure beamforming to improve its secrecy rate performance. The AN covariance matrix in our scheme is more flexible than previous scheme and the region of non-zero secrecy rate is enlarged significantly according to our simulations. For the case with statistical legitimate CSIT, we further prove that the secure beamforming is secrecy capacity achieving for the Rayleigh faded channels. In this case, the AN is not necessary. Extensions to cases where legitimate receiver and eavesdropper have multiple antennas will also be discussed.

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)•Dec 1, 2012•4 citations

Polar Coding for Secure Transmission and Key Agreement

O. Ozan Koyluoglu, H. El Gamal

Achieving information theoretic security with practical coding complexity is of definite interest. This work first focuses on the key agreement problem. For this problem, a new cross-layer secure coding protocol over block fading channels is proposed. The proposed scheme requires only the statistical knowledge about the eavesdropper channel state information (CSI), and, utilizing a privacy amplification technique, reduces the problem of key agreement to a provably secure coding problem per block. Focusing on this secure coding problem, it is shown that polar codes, introduced by Arikan, achieve nonzero perfect secrecy rates for the binary-input degraded wiretap channel while enjoying a remarkably low encoding-decoding complexity. We further show that, in the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. This approach is also extended to the multiple-access channel with a degraded eavesdropper where a nontrivial achievable secrecy region is established. This polar coding method is then utilized in the proposed key agreement protocol, where the secure coding per block is used to create an advantage for the legitimate nodes over the eavesdropper, which is then turned into a private key via the privacy amplification module.

IEEE Transactions on Information Forensics and Security•Jul 10, 2012•81 citations

Secure MISO wiretap channels with multi-antenna passive eavesdropper via artificial fast fading

Hui‐Ming Wang, Tong-Xing Zheng, Pengcheng Mu

We investigate the physical layer security of a multiple-input single-output (MISO) channel in the presence of a multi-antenna passive eavesdropper. Traditionally, artificial noise (AN) scheme is an efficient security strategy without the channel state information (CSI) of the eavesdropper. In this paper, we propose and analyze an efficient security scheme called the artificial fast fading (AFF) scheme. The basic idea is to randomly weight the information symbols at different transmit antennas in a special manner so that the channel of the intended receiver is an AWGN channel while that of the eavesdropper is a fast fading channel. This prevents the eavesdropper obtaining the CSI using the blind channel estimation techniques so that it can only detect the information symbols in a non-coherent way, which greatly reduces the amount of information intercepted. More importantly, we derive the achievable secrecy rate of the sheme and provide a low bound of it, which can be numerically calculated. Compared with the exact secrecy rate of the AN scheme, even the low bound of the AFF scheme is larger, when the eavesdropper has more antennas than the transmitter.

International Conference on Communications•Jun 1, 2014•4 citations

Polar coding for secure transmission and key agreement

O. Ozan Koyluoglu, Hesham El Gamal

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arikan. It is shown that polar codes achieve nontrivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2010•54 citations

Polar Coding for Secure Transmission and Key Agreement

O. Ozan Koyluoglu, Hesham El Gamal

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arıkan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

arXiv:1003.1422•Mar 6, 2010•7 citations
In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper channel state information (CSI) and the case of fading channels with known eavesdropper channel distribution information (CDI). We use the artificial noise assisted secure precoding method to maximize the secrecy capacity in the first case, and to overcome the unawareness of the eavesdropper CSI in the second case. We show that our proposed scheme can provide both reliable and secure communication over the MISOSE channel with low encoding and decoding complexity.
Physical layer security in wireless networks has received increasing attention in recent years. In this paper, we consider multiple-input single-output (MISO) fading wiretap channels, where the transmitter utilizes artificial noise-aided precoding (ANaP) transmission strategy to maximize the secrecy capacity of the channel. When the channel state information (CSI) of Eavesdropper's (Eve's) channel is known at Alice, we prove that the optimal ANaP strategy reduces to the conventional precoding strategy, i.e., all the transmit power should be allocated to the precoding of information signal. When the CSI of Eve's channel is unknown at Alice, we find that there exists an optimal power allocation ratio between the information signal and the artificial noise and that this power ratio depends on the number of antennas as well as the available transmit power at Alice. In particular, when the available transmit power at Alice increases or the number of antennas at Alice decreases, more power should be allocated to the artificial noise.
In this paper, we consider the secure transmission in ergodic fast fading multiple-input single-output single-antenna-eavesdropper (MISOSE) wiretap channels with only the statistics of eavesdropper's channel state information at the transmitter (CSIT). Two kinds of the legitimate CSIT are assumed, that is, full and statistical legitimate CSIT. With full legitimate CSIT, we generalize and optimize the previously proposed artificial noise (AN) aided secure beamforming to improve its secrecy rate performance. The AN covariance matrix in our scheme is more flexible than previous scheme and the region of non-zero secrecy rate is enlarged significantly according to our simulations. For the case with statistical legitimate CSIT, we further prove that the secure beamforming is secrecy capacity achieving for the Rayleigh faded channels. In this case, the AN is not necessary. Extensions to cases where legitimate receiver and eavesdropper have multiple antennas will also be discussed.
Achieving information theoretic security with practical coding complexity is of definite interest. This work first focuses on the key agreement problem. For this problem, a new cross-layer secure coding protocol over block fading channels is proposed. The proposed scheme requires only the statistical knowledge about the eavesdropper channel state information (CSI), and, utilizing a privacy amplification technique, reduces the problem of key agreement to a provably secure coding problem per block. Focusing on this secure coding problem, it is shown that polar codes, introduced by Arikan, achieve nonzero perfect secrecy rates for the binary-input degraded wiretap channel while enjoying a remarkably low encoding-decoding complexity. We further show that, in the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. This approach is also extended to the multiple-access channel with a degraded eavesdropper where a nontrivial achievable secrecy region is established. This polar coding method is then utilized in the proposed key agreement protocol, where the secure coding per block is used to create an advantage for the legitimate nodes over the eavesdropper, which is then turned into a private key via the privacy amplification module.
We investigate the physical layer security of a multiple-input single-output (MISO) channel in the presence of a multi-antenna passive eavesdropper. Traditionally, artificial noise (AN) scheme is an efficient security strategy without the channel state information (CSI) of the eavesdropper. In this paper, we propose and analyze an efficient security scheme called the artificial fast fading (AFF) scheme. The basic idea is to randomly weight the information symbols at different transmit antennas in a special manner so that the channel of the intended receiver is an AWGN channel while that of the eavesdropper is a fast fading channel. This prevents the eavesdropper obtaining the CSI using the blind channel estimation techniques so that it can only detect the information symbols in a non-coherent way, which greatly reduces the amount of information intercepted. More importantly, we derive the achievable secrecy rate of the sheme and provide a low bound of it, which can be numerically calculated. Compared with the exact secrecy rate of the AN scheme, even the low bound of the AFF scheme is larger, when the eavesdropper has more antennas than the transmitter.
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arikan. It is shown that polar codes achieve nontrivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arıkan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.