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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Artificial Error-Based Code Scrambling Scheme for Secure Communications in Wiretap Channels with Channel Reciprocity

Sangjoon Park

Published Jun 15, 2021• 0 citations
Publisher

Abstract

In this letter, an artificial message error-based code scrambling scheme is proposed for secure communications in wiretap channels with channel reciprocity. In the proposed scheme, the artificial message bit errors agreed between the legitimate transmitter and receiver are added to the scrambled message bits at the transmitter prior to the channel encoding procedure, through which the artificial errors are generated by using the reciprocal channel between the legitimate transmitter and receiver. Because of the inaccessibility to the channel state information between the legitimate transmitter and receiver, an eavesdropper would fail to compensate for the artificial errors perfectly. Thus, in addition to decoding errors, the residual artificial errors will also be spread over the descrambled message of the eavesdropper by the error spreading effect of code scrambling. Therefore, unlike the conventional code scrambling scheme, the proposed scheme can provide strong message confidentiality for non-degraded eavesdropping channels, e.g., when the eavesdropper experiences no decoding errors. Furthermore, given that the artificial errors are introduced before the channel encoding procedure, the spread residual errors in the descrambled message remain undetected after the decoding procedures of the eavesdropper. Simulation results confirm that the proposed scheme outperforms the conventional scheme and provides strong message confidentiality in wiretap channels.

DOI
10.1587/transfun.2021eal2008

Related papers

A Scrambling Scheme Based on Random Wireless Channel Characteristics for Secure Transmission

Xiaoyan Hu, Liang Jin, Zhong Zhou

Due to the limited reciprocity of wireless channel, most existing physical-layer security method based on channel characteristics is implemented by repeatedly interacting to generate consistent keys, which resulting in large overhead. This paper proposes a secure transmission scheme based on equivalent channel which is built by random scrambling codes generated from channel characteristics. To improve efficiency and reliability, the legitimate senders scramble the encoded signal and the receivers mitigate the non-reciprocal effect by channel decoding, rather than interacting information to obtain consistent scrambling codes. The channel capacity and security capacity of the scheme are analyzed and simulated in Rayleigh channel model. The results show that the difference of channel characteristics significantly degrade the eavesdropper's receiving performance, so that the received signal cannot be decoded correctly.

IEEE International Conference on Communication Software and Networks•Jun 1, 2020•1 citation

Effective eavesdropping in the Artificial noise aided security scheme

Feilong Wu, Wenjie Wang, Bobin Yao +1 more

The Artificial noise (AN) injection scheme is recently proposed to secure wireless transmissions. By simultaneously transmitting data symbols and artificial interference, it prevents the eavesdropper from decoding the secret message intended for the legitimate receiver. In this paper, we mainly focus on weakness of the AN security scheme. First, we analyze the necessary condition for such a scheme to guarantee that the legitimate transmitter-receiver pair can achieve a positive secrecy communication rate. And then, we further propose an effective eavesdropping strategy to counteract such a security scheme once the condition does not hold up in some wireless systems. Our proposed wiretap method involves complex-valued independent component analysis (ICA) and requires the antenna number of the eavesdropper's is larger or equal to that of the transmitter's. Simulation results demonstrate the effectiveness of this wiretap method.

IEEE/CIC International Conference on Communications in China (ICCC)•Aug 1, 2013•8 citations

A coding scheme to force the eavesdropper falling in error avalanche

Hang Zhao, Aiqun Hu, Jiabao Yu

Abstract In recent years, key generation schemes based on the reciprocity of wireless channels have gained widespread attention in the field of wireless physical layer security. However, due to the openness of wireless channels, eavesdroppers may obtain partial legitimate keys by eavesdropping on the wireless channel. To address this issue, this paper proposes a wireless channel coding scheme that induces an “avalanche” of errors for eavesdroppers, which could maximize eavesdropper's bit error rate. The design of this scheme is based on the significant differences between the eavesdropping channel and the legitimate channel, and the average bit key disagreement ratio of the keys generated by the legitimate channel is around 8%. The scheme selects polar codes with strong error correction capabilities and chooses a coding rate matching the error level of the legitimate channel, forcing the eavesdropping channel's error rate into an “avalanche” state, where the error rate approaches 50%. This paper presents the structure of the encoder and determines the coding rate through simulation. Simulation results demonstrate that this scheme can significantly degrade the error rate of the eavesdropping channel while ensuring the prevention of eavesdroppers from obtaining secret information transmitted through the legitimate channel.

Electronics Letters•May 1, 2024•1 citation

Secrecy capacity of wiretap channels with the bit error rate criterion

Ryutaroh Matsumoto

The coding problem over wiretap channels is to realize an encoder and a decoder such that the legitimate receiver can correctly decode transmitted secret messages while the eavesdropper knows little about the secret messages. Traditionally, the secrecy of messages to the eavesdropper has been measured in terms of mutual information. Recently, several researches on the wiretap channels employ the bit error rate after decoding by the eavesdropper as a secrecy measure. In this note, we show that the secrecy capacity with respect to the bit error rate criterion is different from that with the traditional mutual information criterion. In addition to that, the encoder can be deterministic for the bit error rate criterion, while it must be stochastic for the mutual information criterion.

IEICE Communications Express•Jan 1, 2016•0 citations

Distributed Robust Artificial-Noise-Aided Secure Precoding for Wiretap MIMO Interference Channels

Zhengmin Kong, Jing Song, Shaoshi Yang +4 more

We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.

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

On secure communication over multiple access wiretap channels under channel uncertainty

Rafael F. Schaefer, H. Vincent Poor

The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.

IEEE Conference on Communications and Network Security•Oct 1, 2014•4 citations
In this letter, an artificial message error-based code scrambling scheme is proposed for secure communications in wiretap channels with channel reciprocity. In the proposed scheme, the artificial message bit errors agreed between the legitimate transmitter and receiver are added to the scrambled message bits at the transmitter prior to the channel encoding procedure, through which the artificial errors are generated by using the reciprocal channel between the legitimate transmitter and receiver. Because of the inaccessibility to the channel state information between the legitimate transmitter and receiver, an eavesdropper would fail to compensate for the artificial errors perfectly. Thus, in addition to decoding errors, the residual artificial errors will also be spread over the descrambled message of the eavesdropper by the error spreading effect of code scrambling. Therefore, unlike the conventional code scrambling scheme, the proposed scheme can provide strong message confidentiality for non-degraded eavesdropping channels, e.g., when the eavesdropper experiences no decoding errors. Furthermore, given that the artificial errors are introduced before the channel encoding procedure, the spread residual errors in the descrambled message remain undetected after the decoding procedures of the eavesdropper. Simulation results confirm that the proposed scheme outperforms the conventional scheme and provides strong message confidentiality in wiretap channels.
Due to the limited reciprocity of wireless channel, most existing physical-layer security method based on channel characteristics is implemented by repeatedly interacting to generate consistent keys, which resulting in large overhead. This paper proposes a secure transmission scheme based on equivalent channel which is built by random scrambling codes generated from channel characteristics. To improve efficiency and reliability, the legitimate senders scramble the encoded signal and the receivers mitigate the non-reciprocal effect by channel decoding, rather than interacting information to obtain consistent scrambling codes. The channel capacity and security capacity of the scheme are analyzed and simulated in Rayleigh channel model. The results show that the difference of channel characteristics significantly degrade the eavesdropper's receiving performance, so that the received signal cannot be decoded correctly.
The Artificial noise (AN) injection scheme is recently proposed to secure wireless transmissions. By simultaneously transmitting data symbols and artificial interference, it prevents the eavesdropper from decoding the secret message intended for the legitimate receiver. In this paper, we mainly focus on weakness of the AN security scheme. First, we analyze the necessary condition for such a scheme to guarantee that the legitimate transmitter-receiver pair can achieve a positive secrecy communication rate. And then, we further propose an effective eavesdropping strategy to counteract such a security scheme once the condition does not hold up in some wireless systems. Our proposed wiretap method involves complex-valued independent component analysis (ICA) and requires the antenna number of the eavesdropper's is larger or equal to that of the transmitter's. Simulation results demonstrate the effectiveness of this wiretap method.
Abstract In recent years, key generation schemes based on the reciprocity of wireless channels have gained widespread attention in the field of wireless physical layer security. However, due to the openness of wireless channels, eavesdroppers may obtain partial legitimate keys by eavesdropping on the wireless channel. To address this issue, this paper proposes a wireless channel coding scheme that induces an “avalanche” of errors for eavesdroppers, which could maximize eavesdropper's bit error rate. The design of this scheme is based on the significant differences between the eavesdropping channel and the legitimate channel, and the average bit key disagreement ratio of the keys generated by the legitimate channel is around 8%. The scheme selects polar codes with strong error correction capabilities and chooses a coding rate matching the error level of the legitimate channel, forcing the eavesdropping channel's error rate into an “avalanche” state, where the error rate approaches 50%. This paper presents the structure of the encoder and determines the coding rate through simulation. Simulation results demonstrate that this scheme can significantly degrade the error rate of the eavesdropping channel while ensuring the prevention of eavesdroppers from obtaining secret information transmitted through the legitimate channel.
The coding problem over wiretap channels is to realize an encoder and a decoder such that the legitimate receiver can correctly decode transmitted secret messages while the eavesdropper knows little about the secret messages. Traditionally, the secrecy of messages to the eavesdropper has been measured in terms of mutual information. Recently, several researches on the wiretap channels employ the bit error rate after decoding by the eavesdropper as a secrecy measure. In this note, we show that the secrecy capacity with respect to the bit error rate criterion is different from that with the traditional mutual information criterion. In addition to that, the encoder can be deterministic for the bit error rate criterion, while it must be stochastic for the mutual information criterion.
We propose a distributed artificial noise-assisted precoding scheme for secure communications over wiretap multi-input multi-output (MIMO) interference channels, where K legitimate transmitter-receiver pairs communicate in the presence of a sophisticated eavesdropper having more receive-antennas than the legitimate user. Realistic constraints are considered by imposing statistical error bounds for the channel state information of both the eavesdropping and interference channels. Based on the asynchronous distributed pricing model, the proposed scheme maximizes the total utility of all the users, where each user’s utility function is defined as the secrecy rate minus the interference cost imposed on other users. Using the weighted minimum mean square error, Schur complement and sign-definiteness techniques, the original non-concave optimization problem is approximated with high accuracy as a quasi-concave problem, which can be solved by the alternating convex search method. Simulation results consolidate our theoretical analysis and show that the proposed scheme outperforms the artificial noise-assisted interference alignment and minimum total mean-square error-based schemes.
The problem of secure communication over a multiple access wiretap channel (MAWC) is studied. Here, two transmitters send confidential messages to a legitimate receiver while keeping a non-legitimate eavesdropper ignorant of them. In this paper, this communication scenario is studied for compound channels, for which it is only known to the users that the actual channel realization is fixed and belongs to a known set of possible channels. The criterion of strong secrecy is analyzed and its impact on the decoding performance of the eavesdropper is specified. It is shown that the average decoding error at the eavesdropper approaches one exponentially fast regardless of the applied decoding strategy. Furthermore, an achievable strong secrecy rate region is presented and a multi-letter outer bound is derived. Both together establish a multi-letter description of the strong secrecy capacity region.