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

Active Secure Coding Based on Eavesdropper Behavior Learning.

Yizhi Zhao

Published Jul 9, 2018• 0 citations
OpenAlex

Abstract

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.

Related papers

CSI learning based active secure coding scheme for detectable wiretap channel

Yizhi Zhao

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.

arXiv:1807.02924•IET Communications•Sep 17, 2020•1 citation

Secure Polar Coding for the Two-Way Wiretap Channel

Mengfan Zheng, Meixia Tao, Wen Chen +1 more

In this paper, we consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously, while a passive eavesdropper overhears a combination of their exchanged signals. We design a low complexity polar coded cooperative jamming scheme that achieves the whole secrecy rate region of the general two-way wiretap channel under the strong secrecy criterion. The chaining method is used to make proper alignment of polar indices. The randomness required to be shared between two legitimate users is treated as a limited resource and we show that its rate can be made negligible by increasing the blocklength and the number of chained blocks. For the special case when the eavesdropper channel is degraded with respect to the legitimate ones, a simplified scheme is proposed which can simultaneously ensure reliability and weak secrecy within a single transmission block.

arXiv:1612.00130•IEEE Access•Jan 1, 2018•16 citations

Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes

Hessam Mahdavifar, Alexander Vardy

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of Eve's equivocation ratio. Wyner showed that the situation is characterized by a single constant C_s, called the secrecy capacity, which has the following meaning: for all $ε> 0$, there exist coding schemes of rate $R \ge C_s - ε$ that asymptotically achieve both the reliability and the security objectives. However, his proof of this result is based upon a nonconstructive random-coding argument. To date, despite a considerable research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel C_2 is an erasure channel, or a combinatorial variation thereof. Polar codes were recently invented by Arikan; they approach the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Herein, we use polar codes to construct a coding scheme that achieves the secrecy capacity for a wide range of wiretap channels. Our construction works for any instantiation of the wiretap channel model, as long as both C_1 and C_2 are symmetric and binary-input, and C_2 is degraded with respect to C_1. Moreover, we show how to modify our construction in order to provide strong security, in the sense defined by Maurer, while still operating at a rate that approaches the secrecy capacity. In this case, we cannot guarantee that the reliability condition will be satisfied unless the main channel C_1 is noiseless, although we believe it can be always satisfied in practice.

arXiv:1001.0210•Jan 1, 2010•0 citations

Irregular Channel Polarization and Its Applications to Static Adversarial Wiretap Channel

Yizhi Zhao

The problem of achieving the secrecy capacity of static adversarial wiretap channel with discrete memoryless channels is studied in this paper. To construct the explicit secure coding scheme, an irregular channel polarization operation is proposed which is the extension of Ar{\i}kan's channel polarization. As theoretically proofed, for $N$ independent initial channels with different transition probabilities, channels generated by the operation $\mathbf{G}_N$ are also polarized into full noise channels and noiseless channels, same as the regular channel polarization. Then for the adversarial behaviors including directly reading and rewriting, equivalent channels are constructed by channel cascading with full noise or noiseless binary erase channels. Finally by applying the irregular channel polarization to the equivalent channels, a secure polar coding scheme is constructed which successfully achieves the secrecy capacity of static adversarial wiretap channel with discrete memoryless channels under the reliability and strong security criterions.

arXiv:1812.00160•Dec 1, 2018•0 citations

Strong secrecy communication of arbitrarily varying wiretap channels with causal state information at the encoder

Chen Yiqi, Dong Chen, Luo Yuan

To achieve reliable and secure communication over a channel in presence of a jammer and an eavesdropper, in which the encoder observed the jamming signal before transmitting each input symbol, a coding scheme was proposed, and the fundamental limits of the communication system was studied. The proposed coding scheme encoded each message using the observed jamming signal and was constructed as a code for reliable and secure communication over compound channels. Then, a set of random permutations over the codewords was used and the compound channel code was transformed into a code that could achieve reliable and secure communication over channels against arbitrarily varying jamming signals. A lower bound of the strong secrecy communication rate has been established. By analyzing the code over channels whose main channel is severely less noisy than the wiretap channel, the strong secrecy capacity of the channel is established and the proposed coding scheme is the optimal scheme.

•Apr 1, 2026•0 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
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 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.
In this paper, we consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously, while a passive eavesdropper overhears a combination of their exchanged signals. We design a low complexity polar coded cooperative jamming scheme that achieves the whole secrecy rate region of the general two-way wiretap channel under the strong secrecy criterion. The chaining method is used to make proper alignment of polar indices. The randomness required to be shared between two legitimate users is treated as a limited resource and we show that its rate can be made negligible by increasing the blocklength and the number of chained blocks. For the special case when the eavesdropper channel is degraded with respect to the legitimate ones, a simplified scheme is proposed which can simultaneously ensure reliability and weak secrecy within a single transmission block.
Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of Eve's equivocation ratio. Wyner showed that the situation is characterized by a single constant C_s, called the secrecy capacity, which has the following meaning: for all ε>0ε> 0ε>0, there exist coding schemes of rate R≥Cs−εR \ge C_s - εR≥Cs​−ε that asymptotically achieve both the reliability and the security objectives. However, his proof of this result is based upon a nonconstructive random-coding argument. To date, despite a considerable research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel C_2 is an erasure channel, or a combinatorial variation thereof. Polar codes were recently invented by Arikan; they approach the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Herein, we use polar codes to construct a coding scheme that achieves the secrecy capacity for a wide range of wiretap channels. Our construction works for any instantiation of the wiretap channel model, as long as both C_1 and C_2 are symmetric and binary-input, and C_2 is degraded with respect to C_1. Moreover, we show how to modify our construction in order to provide strong security, in the sense defined by Maurer, while still operating at a rate that approaches the secrecy capacity. In this case, we cannot guarantee that the reliability condition will be satisfied unless the main channel C_1 is noiseless, although we believe it can be always satisfied in practice.
The problem of achieving the secrecy capacity of static adversarial wiretap channel with discrete memoryless channels is studied in this paper. To construct the explicit secure coding scheme, an irregular channel polarization operation is proposed which is the extension of Ar{\i}kan's channel polarization. As theoretically proofed, for NNN independent initial channels with different transition probabilities, channels generated by the operation GN\mathbf{G}_NGN​ are also polarized into full noise channels and noiseless channels, same as the regular channel polarization. Then for the adversarial behaviors including directly reading and rewriting, equivalent channels are constructed by channel cascading with full noise or noiseless binary erase channels. Finally by applying the irregular channel polarization to the equivalent channels, a secure polar coding scheme is constructed which successfully achieves the secrecy capacity of static adversarial wiretap channel with discrete memoryless channels under the reliability and strong security criterions.
To achieve reliable and secure communication over a channel in presence of a jammer and an eavesdropper, in which the encoder observed the jamming signal before transmitting each input symbol, a coding scheme was proposed, and the fundamental limits of the communication system was studied. The proposed coding scheme encoded each message using the observed jamming signal and was constructed as a code for reliable and secure communication over compound channels. Then, a set of random permutations over the codewords was used and the compound channel code was transformed into a code that could achieve reliable and secure communication over channels against arbitrarily varying jamming signals. A lower bound of the strong secrecy communication rate has been established. By analyzing the code over channels whose main channel is severely less noisy than the wiretap channel, the strong secrecy capacity of the channel is established and the proposed coding scheme is the optimal scheme.
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.