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

IET Information Security

Encrypted secure polar coding scheme for general two‐way wiretap channel

Yizhi Zhao, Shiwei Xu, Hongmei Chi

Published Feb 11, 2019• 1 citation
Publisher

Abstract

The authors consider the problems of key exchange for one‐time pad along with the problem of rate sacrifice for secure polar coding over the two‐way wiretap channel under the strong security criterion. Based on existing techniques, they present a new hash chaining structure to solve the good bits sacrificing problem for achieving the strong security and constructed encryption embedded secure polar coding scheme for two‐way wiretap channel. To implement a one‐time pad without any key pre‐sharing, they design a secure and reliable transmission for both key and ciphertext coupling with the cooperative jamming strategy, which can also increase the secrecy rate for communication. As proved, extended upper bounds for both achievable secrecy rate pair and effective secrecy rate pair can be achieved under the strong security and reliability criterions.

DOI
10.1049/iet-ifs.2018.5472

Related papers

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

Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming

Rémi A. Chou, Aylin Yener

We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters - no degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with a low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting and different cooperative jamming strategies. Specifically, our coding scheme combines several point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on a chaining construction to be able to deal with an arbitrary channel and strong secrecy. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•16 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 the Multiple Access Wiretap Channel via Rate-Splitting and Cooperative Jamming

Rémi A. Chou, Aylin Yener

We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.

IEEE Transactions on Information Theory•Aug 16, 2018•28 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

Strong Secrecy for Relay Wiretap Channels with Polar Codes and Double-Chaining

Emmanouil M. Athanasakos, George K. Karagiannidis

Secure communication for the primitive relay wiretap channel under the decode-and-forward protocol, is considered. A polar coding-based technique is proposed and we show that is suitable to provide reliability and a level of information-theoretic security. We focus on the strong secrecy criterion where in order to satisfy it we implement a double-chaining construction to overcome the obstacle of misaligned bits.

Globecom•Dec 1, 2020•4 citations
The authors consider the problems of key exchange for one‐time pad along with the problem of rate sacrifice for secure polar coding over the two‐way wiretap channel under the strong security criterion. Based on existing techniques, they present a new hash chaining structure to solve the good bits sacrificing problem for achieving the strong security and constructed encryption embedded secure polar coding scheme for two‐way wiretap channel. To implement a one‐time pad without any key pre‐sharing, they design a secure and reliable transmission for both key and ciphertext coupling with the cooperative jamming strategy, which can also increase the secrecy rate for communication. As proved, extended upper bounds for both achievable secrecy rate pair and effective secrecy rate pair can be achieved under the strong security and reliability criterions.
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.
We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters - no degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with a low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting and different cooperative jamming strategies. Specifically, our coding scheme combines several point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on a chaining construction to be able to deal with an arbitrary channel and strong secrecy. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.
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.
We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.
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.