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:1812.00160

Irregular Channel Polarization and Its Applications to Static Adversarial Wiretap Channel

Yizhi Zhao

Published Dec 1, 2018• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Secure Polar Coding for Adversarial Wiretap Channel

Yizhi Zhao

The adversarial wiretap channel (AWTC) model is a secure communication model in which adversary can directly read and write the transmitted bits in legitimate communication with fixed fractions. In this paper we propose a secure polar coding scheme to provide secure and reliable communication over the AWTC model. For the adversarial reading and writing action, we present a $ρ$ equivalent channel block and study its transformation under the channel polarization operation. We find that the generated channels are polarized in the sense that part of them are full-noise channels with probability almost $1$ and the rest part of them are noiseless channels with probability almost $1$. Based on this result, we polarize both equivalent channel blocks of adversarial reading and writing, and then construct a secure polar coding scheme by applying the multi-block chaining structure on the polarized equivalent blocks. Theoretically we prove that when block length $N$ goes infinity, the proposed scheme achieves the secrecy capacity of the AWTC model under both reliability and strong security criterions. Then by simulations, we prove that the proposed scheme can provide secure and reliable communication over AWTC model.

arXiv:2003.00240•Feb 29, 2020•0 citations

Polar Coding for Wiretap Channels With Random States Non-Causally Available at the Encoder

Xingyu Chen, Huici Wu, Xiaofeng Tao +1 more

Channel state information (CSI) is differently available at each terminal in state-dependent wiretap channels (SD-WTCs). Considering a random channel state non-causally available only at the encoder, this paper investigates an explicit polar coding scheme for the discrete and memoryless SD-WTC, where Alice aims to transmit a secret message (SM) and a secret key (SK) to Bob while concealing them from Eve. Based on a two-layer superposition coding, which includes an inner layer and an outer layer, the proposed polar coding scheme can achieve the inner bound of the current optimal SM-SK capacity region for the discrete and memoryless SD-WTC with CSI non-causally available only at the encoder. A cross-layer construction is proposed to address the issue where the regular chaining construction used in wiretap polar codes cannot be applied in the inner layer. Results show that the decoding error probability (DEP) of the legitimate decoder vanishes to zero as the block length increases. In addition, the proposed scheme is proven to satisfy strong secrecy.

IEEE Transactions on Information Forensics and Security•Jan 1, 2024•4 citations

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

Probabilistic Shaped Multilevel Polar Coding for Wiretap Channel

Li Shen, Yongpeng Wu, Peihong Yuan +3 more

A wiretap channel is served as the fundamental model of physical layer security techniques, where the secrecy capacity of the Gaussian wiretap channel is proven to be achieved by Gaussian input. However, there remains a gap between the Gaussian secrecy capacity and the secrecy rate with conventional uniformly distributed discrete constellation input, e.g. amplitude shift keying (ASK) and quadrature amplitude modulation (QAM). In this paper, we propose a probabilistic shaped multilevel polar coding scheme to bridge the gap. Specifically, the input distribution optimization problem for maximizing the secrecy rate with ASK/QAM input is solved. Numerical results show that the resulting sub-optimal solution can still approach the Gaussian secrecy capacity. Then, we investigate the polarization of multilevel polar codes for the asymmetric discrete memoryless wiretap channel, and thus propose a multilevel polar coding scheme integration with probabilistic shaping. It is proved that the scheme can achieve the secrecy capacity of the Gaussian wiretap channel with discrete constellation input, and satisfies the reliability condition and weak security condition. A security-oriented polar code construction method to natively satisfies the leakage-based security condition is also investigated. Simulation results show that the proposed scheme achieves more efficient and secure transmission than the uniform constellation input case over both the Gaussian wiretap channel and the Rayleigh fading wiretap channel.

arXiv:2411.06339•IEEE Journal on Selected Areas in Communications•Jan 30, 2025•0 citations

A new wiretap channel model and its strong secrecy capacity

Mohamed Nafea, Aylin Yener

In this paper, a new wiretap channel (WTC) model with a discrete memoryless (DM) main channel and a wiretapper who noiselessly observes a fixed portion, of her choice, of the transmitted symbols, while observing the remaining transmitted symbols through another DM channel (DMC), is considered. The strong secrecy capacity of the model is identified. The achievability is established using the output statistics of random binning framework which exploits the duality between source and channel coding problems. The converse is derived by upper bounding the secrecy capacity of an equivalent model with the secrecy capacity of a DM-WTC. This result generalizes both the classical DM-WTC and the WTC-II with a DM main channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•11 citations

A New Wiretap Channel Model and Its Strong Secrecy Capacity

Mohamed Nafea, Aylin Yener

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted code word symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases, and is termed as the generalized wiretap channel for that reason. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at the wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the generalized wiretap channel by the secrecy capacity when the tapped subset is randomly chosen by nature.

arXiv:1701.07007•IEEE Transactions on Information Theory•Dec 22, 2017•26 citations
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.
The adversarial wiretap channel (AWTC) model is a secure communication model in which adversary can directly read and write the transmitted bits in legitimate communication with fixed fractions. In this paper we propose a secure polar coding scheme to provide secure and reliable communication over the AWTC model. For the adversarial reading and writing action, we present a ρρρ equivalent channel block and study its transformation under the channel polarization operation. We find that the generated channels are polarized in the sense that part of them are full-noise channels with probability almost 111 and the rest part of them are noiseless channels with probability almost 111. Based on this result, we polarize both equivalent channel blocks of adversarial reading and writing, and then construct a secure polar coding scheme by applying the multi-block chaining structure on the polarized equivalent blocks. Theoretically we prove that when block length NNN goes infinity, the proposed scheme achieves the secrecy capacity of the AWTC model under both reliability and strong security criterions. Then by simulations, we prove that the proposed scheme can provide secure and reliable communication over AWTC model.
Channel state information (CSI) is differently available at each terminal in state-dependent wiretap channels (SD-WTCs). Considering a random channel state non-causally available only at the encoder, this paper investigates an explicit polar coding scheme for the discrete and memoryless SD-WTC, where Alice aims to transmit a secret message (SM) and a secret key (SK) to Bob while concealing them from Eve. Based on a two-layer superposition coding, which includes an inner layer and an outer layer, the proposed polar coding scheme can achieve the inner bound of the current optimal SM-SK capacity region for the discrete and memoryless SD-WTC with CSI non-causally available only at the encoder. A cross-layer construction is proposed to address the issue where the regular chaining construction used in wiretap polar codes cannot be applied in the inner layer. Results show that the decoding error probability (DEP) of the legitimate decoder vanishes to zero as the block length increases. In addition, the proposed scheme is proven to satisfy strong secrecy.
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.
A wiretap channel is served as the fundamental model of physical layer security techniques, where the secrecy capacity of the Gaussian wiretap channel is proven to be achieved by Gaussian input. However, there remains a gap between the Gaussian secrecy capacity and the secrecy rate with conventional uniformly distributed discrete constellation input, e.g. amplitude shift keying (ASK) and quadrature amplitude modulation (QAM). In this paper, we propose a probabilistic shaped multilevel polar coding scheme to bridge the gap. Specifically, the input distribution optimization problem for maximizing the secrecy rate with ASK/QAM input is solved. Numerical results show that the resulting sub-optimal solution can still approach the Gaussian secrecy capacity. Then, we investigate the polarization of multilevel polar codes for the asymmetric discrete memoryless wiretap channel, and thus propose a multilevel polar coding scheme integration with probabilistic shaping. It is proved that the scheme can achieve the secrecy capacity of the Gaussian wiretap channel with discrete constellation input, and satisfies the reliability condition and weak security condition. A security-oriented polar code construction method to natively satisfies the leakage-based security condition is also investigated. Simulation results show that the proposed scheme achieves more efficient and secure transmission than the uniform constellation input case over both the Gaussian wiretap channel and the Rayleigh fading wiretap channel.
In this paper, a new wiretap channel (WTC) model with a discrete memoryless (DM) main channel and a wiretapper who noiselessly observes a fixed portion, of her choice, of the transmitted symbols, while observing the remaining transmitted symbols through another DM channel (DMC), is considered. The strong secrecy capacity of the model is identified. The achievability is established using the output statistics of random binning framework which exploits the duality between source and channel coding problems. The converse is derived by upper bounding the secrecy capacity of an equivalent model with the secrecy capacity of a DM-WTC. This result generalizes both the classical DM-WTC and the WTC-II with a DM main channel.
In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted code word symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases, and is termed as the generalized wiretap channel for that reason. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at the wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the generalized wiretap channel by the secrecy capacity when the tapped subset is randomly chosen by nature.