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:1807.02924 · IET Communications

CSI learning based active secure coding scheme for detectable wiretap channel

Yizhi Zhao

Published Sep 17, 2020• 1 citation
arXivHTMLPDF

Abstract

In this study, the authors consider the problem of secure and reliable communication with uncertain channel state information (CSI) and present a new solution named active secure coding which combines the machine‐learning methods with the traditional physical‐layer secure coding scheme. First, the authors build a detectable wiretap channel model by combining the hidden Markov model with the compound wiretap channel model, in which the varying of channel block CSI is a Markov process and the detected information is a stochastic emission from the current CSI. Next, the authors present a CSI‐learning scheme to learn the CSI from the detected information by the Baum–Welch and Viterbi algorithms. Then the authors construct explicit secure polar codes based on the learned CSI, and combine it with the CSI‐learning scheme to form the active secure polar coding scheme. Simulation results show that an acceptable level of reliability and security can be achieved by the proposed active secure polar coding scheme.

DOI
10.1049/iet-com.2019.0159

Related papers

Active Secure Coding Based on Eavesdropper Behavior Learning.

Yizhi Zhao

The secrecy capacity achieving problem of the wiretap channel against an active eavesdropper with unlimited computational power over is an important foresighted task for secure communication. For active wiretap channel, the effectiveness of cryptography embedded secure coding schemes are limited due to the passive problem of physical layer coding. Thus in this paper, a novel solution called active secure coding scheme is proposed which combines physical secure coding with machine learning to implement an active defense against the active eavesdropper. To construct an universal active method for secure coding, an abstract active wiretap channel model is constructed under the detectable precondition, in which hidden Markov model is employed to build the internal eavesdropper behavior pattern (the stochastic process for eavesdropper behavior states) with stochastically mapped external observations. Based on the abstract model, an eavesdropper behavior pattern learning and eavesdropper behavior states decoding are constructed for estimating the optimal eavesdropper behavior states, which enables the secure coding scheme to respond the eavesdropper actively. Then this active secure coding method is performed to the general varying wiretap channel to construct an explicit active secure polar coding scheme. As proofed, the proposed active secure polar coding scheme can theoretically achieve the average secrecy capacity of $t$ times secure transmissions under the reliability and strong security criterions.

•Jul 9, 2018•0 citations

Secure polar coding with delayed wiretapping information

Yizhi Zhao, Hongmei Chi

In this study, the authors investigate the secure coding issue for a wiretap channel model with fixed main channel and varying wiretap channel, by assuming that legitimate parties can obtain the wiretapping channel state information (CSI) with some delay. For the symmetric degraded delay CSI case, they present an explicit weak security scheme by constructing secure polar codes on a one‐time pad chaining structure, and prove its weak security, reliability and capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. Further for the symmetric no‐degraded delay CSI case, they present a modified multi‐block chaining structure in which the original subset of frozen bit is designed for conveying functional random bits securely. Then they combine this modified multi‐block chaining structure with the weak security scheme to construct an explicit strong security polar coding scheme, and prove its strong security, reliability and also the capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. At last, they carry out simulations to prove the performance of both secure schemes.

arXiv:1812.11271•IET Communications•Jun 11, 2020•1 citation

Polar Coding for Secure Transmission in MISO Fading Wiretap Channels

Mengfan Zheng, Meixia Tao, Wen Chen

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.

arXiv:1411.2463•Nov 10, 2014•6 citations

Cooperative jamming polar codes for multiple‐access wiretap channels

Mona Hajimomeni, Hassan Aghaeinia, Il‐Min Kim +1 more

The authors study cooperative security in the physical layer of wireless systems based on the recently developed polar codes for multiple access channel (MAC). Specifically, the authors first consider the case of a m ‐user MAC with external eavesdropper. Using polar alignment, the authors formulate a discrete optimisation problem where security and reliability criteria can be handled separately over the bases of a set of deterministic binary matrices. A discrete algorithm with incrementally polynomial complexity is used to maximise the uniform sum secrecy rate of users. Moreover, the proposed coding scheme is shown to achieve strong security for any subset of users. The authors next examine the case of minimum number of cooperative helpers to fulfil a feasible secrecy rate requirement at the legitimate user. Here, a low‐complexity suboptimal algorithm is presented with at most one helper more than the optimal solution. Using Tal–Sharov–Vardy implementation of MAC polar codes, secure polar coding is implemented for a 2‐user Gaussian wiretap MAC channel. The upper and lower bound of block error probability are compared, respectively, at the legitimate receiver and the eavesdropper. The results demonstrate clearly that with sufficiently long block length, strong secrecy with respect to the eavesdropper is achieved, while block error probability approaches 0.5.

IET Communications•Feb 17, 2016•7 citations

Hierarchical Polar Coding for Achieving Secrecy Over State-Dependent Wiretap Channels Without Any Instantaneous CSI

Hongbo Si, O. Ozan Koyluoglu, Sriram Vishwanath

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.

IEEE Transactions on Communications•Jul 18, 2016•10 citations

Secure transmission scheme for parallel relay channels based on polar coding

Ce Sun, Zesong Fei, Dai Jia +2 more

This paper considers the use of polar codes to enable secure transmission over parallel relay channels. By exploiting the properties of polar codes over parallel channels, a polar encoding algorithm is designed based on Channel State Information (CSI) between the legitimate transmitter (Alice) and the legitimate receiver (Bob). Different from existing secure transmission schemes, the proposed scheme does not require CSI between Alice and the eavesdropper (Eve). The proposed scheme is proven to be reliable and shown to be capable of transmitting information securely under Amplify-and-Forward (AF) relay protocol, thereby providing security against passive and active attackers.

Tsinghua Science & Technology•Jun 1, 2018•11 citations
In this study, the authors consider the problem of secure and reliable communication with uncertain channel state information (CSI) and present a new solution named active secure coding which combines the machine‐learning methods with the traditional physical‐layer secure coding scheme. First, the authors build a detectable wiretap channel model by combining the hidden Markov model with the compound wiretap channel model, in which the varying of channel block CSI is a Markov process and the detected information is a stochastic emission from the current CSI. Next, the authors present a CSI‐learning scheme to learn the CSI from the detected information by the Baum–Welch and Viterbi algorithms. Then the authors construct explicit secure polar codes based on the learned CSI, and combine it with the CSI‐learning scheme to form the active secure polar coding scheme. Simulation results show that an acceptable level of reliability and security can be achieved by the proposed active secure polar coding scheme.
The secrecy capacity achieving problem of the wiretap channel against an active eavesdropper with unlimited computational power over is an important foresighted task for secure communication. For active wiretap channel, the effectiveness of cryptography embedded secure coding schemes are limited due to the passive problem of physical layer coding. Thus in this paper, a novel solution called active secure coding scheme is proposed which combines physical secure coding with machine learning to implement an active defense against the active eavesdropper. To construct an universal active method for secure coding, an abstract active wiretap channel model is constructed under the detectable precondition, in which hidden Markov model is employed to build the internal eavesdropper behavior pattern (the stochastic process for eavesdropper behavior states) with stochastically mapped external observations. Based on the abstract model, an eavesdropper behavior pattern learning and eavesdropper behavior states decoding are constructed for estimating the optimal eavesdropper behavior states, which enables the secure coding scheme to respond the eavesdropper actively. Then this active secure coding method is performed to the general varying wiretap channel to construct an explicit active secure polar coding scheme. As proofed, the proposed active secure polar coding scheme can theoretically achieve the average secrecy capacity of ttt times secure transmissions under the reliability and strong security criterions.
In this study, the authors investigate the secure coding issue for a wiretap channel model with fixed main channel and varying wiretap channel, by assuming that legitimate parties can obtain the wiretapping channel state information (CSI) with some delay. For the symmetric degraded delay CSI case, they present an explicit weak security scheme by constructing secure polar codes on a one‐time pad chaining structure, and prove its weak security, reliability and capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. Further for the symmetric no‐degraded delay CSI case, they present a modified multi‐block chaining structure in which the original subset of frozen bit is designed for conveying functional random bits securely. Then they combine this modified multi‐block chaining structure with the weak security scheme to construct an explicit strong security polar coding scheme, and prove its strong security, reliability and also the capability of approaching the secrecy capacity for perfect CSI case with delay CSI assumption. At last, they carry out simulations to prove the performance of both secure schemes.
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.
The authors study cooperative security in the physical layer of wireless systems based on the recently developed polar codes for multiple access channel (MAC). Specifically, the authors first consider the case of a m ‐user MAC with external eavesdropper. Using polar alignment, the authors formulate a discrete optimisation problem where security and reliability criteria can be handled separately over the bases of a set of deterministic binary matrices. A discrete algorithm with incrementally polynomial complexity is used to maximise the uniform sum secrecy rate of users. Moreover, the proposed coding scheme is shown to achieve strong security for any subset of users. The authors next examine the case of minimum number of cooperative helpers to fulfil a feasible secrecy rate requirement at the legitimate user. Here, a low‐complexity suboptimal algorithm is presented with at most one helper more than the optimal solution. Using Tal–Sharov–Vardy implementation of MAC polar codes, secure polar coding is implemented for a 2‐user Gaussian wiretap MAC channel. The upper and lower bound of block error probability are compared, respectively, at the legitimate receiver and the eavesdropper. The results demonstrate clearly that with sufficiently long block length, strong secrecy with respect to the eavesdropper is achieved, while block error probability approaches 0.5.
This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.
This paper considers the use of polar codes to enable secure transmission over parallel relay channels. By exploiting the properties of polar codes over parallel channels, a polar encoding algorithm is designed based on Channel State Information (CSI) between the legitimate transmitter (Alice) and the legitimate receiver (Bob). Different from existing secure transmission schemes, the proposed scheme does not require CSI between Alice and the eavesdropper (Eve). The proposed scheme is proven to be reliable and shown to be capable of transmitting information securely under Amplify-and-Forward (AF) relay protocol, thereby providing security against passive and active attackers.