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

Globecom

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

Emmanouil M. Athanasakos, George K. Karagiannidis

Published Dec 1, 2020• 5 citations
Publisher

Abstract

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.

DOI
10.1109/globecom42002.2020.9347956

Related papers

Secure Polar Coding for the Primitive Relay Wiretap Channel

Manos Athanasakos, George K. Karagiannidis

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source's message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.

Entropy•Apr 9, 2021•0 citations

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

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

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

Yizhi Zhao, Shiwei Xu, Hongmei Chi

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.

IET Information Security•Feb 11, 2019•1 citation

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 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•12 citations
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.
With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source's message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.
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.
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.
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 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.
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.