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

IEEE Transactions on Wireless Communications

Secrecy-Enhancing Signaling Schemes for Fast-Varying Wiretap Channels With Only CSI at the Transmitter

Pang-Chang Lan, Y.-W. Peter Hong, C.‐C. Jay Kuo

Published Oct 7, 2016• 2 citations
Publisher

Abstract

This paper proposes secrecy-enhancing signaling schemes to exploit the advantages of having only channel state information (CSI) at the transmitter, but no (or limited) CSI at the receiver and the eavesdropper in fast-fading wiretap channels and also in wiretap channels with Gaussian interference. With only CSI at the transmitter, the transmit signaling can be designed to precompensate for the distortion or the interference on the main channel to facilitate decoding at the receiver while leaving the eavesdropper confused by the uncertainties of its own channel. In fading wiretap channels, truncated channel-inversion and phase-compensation schemes are proposed to achieve this task. Here, truncation is used so that transmission occurs only when the main channel is sufficiently reliable. In wiretap channels with Gaussian interference, a truncated interference-nulling scheme is proposed to enable interference precancellation at the transmitter. The proposed signaling schemes exploit the advantages of having only CSI at the transmitter without employing more complex encoding schemes. The achievable secrecy rates are derived using Gaussian input, and approximate expressions are proposed for the optimization of system parameters. The effectiveness of the proposed transmission schemes and the advantages of having only CSI at the transmitter are demonstrated through numerical simulations.

DOI
10.1109/twc.2016.2615902

Related papers

Enhancing secrecy in fading wiretap channels with only transmitter-side channel state information

Pang-Chang Lan, Y.-W. Peter Hong, C.‐C. Jay Kuo

This work examines the advantages of having only channel state information at the transmitter (CSIT), and not at the receiver and the eavesdropper, when achieving secrecy in fading wiretap channels. The key idea is that, with only CSIT, the transmitter can pre-compensate for the amplitude and phase distortions on the main channel. This allows the receiver to decode coherently even without knowledge of the CSI, while leaving the eavesdropper confused by the unknown variations of its own channel. When the channel is reciprocal, this CSI assumption can be achieved in practice through reverse training, i.e., by having the receiver emit the training signal so that the transmitter can estimate the channel by itself. Two secrecy-enhancing transmission schemes are proposed to exploit the CSIT. The truncated channel inversion scheme is used when the receiver and the eavesdropper have no CSI available, and the truncated phase compensation scheme is adopted when they can practically measure the SNR. The achievable secrecy rates of these schemes are derived for both single-antenna and multi-antenna wireless fading scenarios. Numerical results show significant improvements in secrecy rate compared to the case with full CSI at all terminals.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2014•6 citations

A Broadcast Approach for Fading Wiretap Channels

Yingbin Liang, Lifeng Lai, H. Vincent Poor +1 more

A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter. Two broadcast schemes, based on superposition coding and embedded coding, respectively, are developed to encode information into a number of layers and use stochastic encoding to keep the corresponding information secret from an eavesdropper. The layers that can be successfully and securely transmitted are determined by the channel states to the legitimate receiver and the eavesdropper. The advantage of these broadcast approaches is that the transmitter does not need to know the CSI to the legitimate receiver and the eavesdropper, but the scheme still adapts to the channel states of the legitimate receiver and the eavesdropper. Three scenarios of block fading wiretap channels with stringent delay constraints are studied, in which either the legitimate receiver's channel, the eavesdropper's channel, or both channels are fading. For each scenario, the secrecy rate that can be achieved via the broadcast approach developed in this paper is derived, and the optimal power allocation over the layers (or the conditions on the optimal power allocation) is also characterized. A notion of probabilistic secrecy, which characterizes the probability that a certain secrecy rate of decoded messages is achieved during one block, is also introduced and studied for scenarios when the eavesdropper's channel is fading. Numerical examples are provided to demonstrate the impact of the CSI at the transmitter and the channel fluctuations of the eavesdropper on the average secrecy rate. These examples also demonstrate the advantage of the proposed broadcast approach over the compound channel approach.

IEEE Transactions on Information Theory•Jan 24, 2014•42 citations

On–Off-Based Secure Transmission Design With Outdated Channel State Information

Jianwei Hu, Weiwei Yang, Nan Yang +2 more

We design new secure on-off transmission schemes in wiretap channels with outdated channel state information (CSI). In our design, we consider not only the outdated CSI from the legitimate receiver but two distinct scenarios as well, depending on whether the outdated CSI from the eavesdropper is known at the transmitter. Under this consideration, our schemes exploit useful knowledge contained in the available outdated CSI, and based on this, the transmitter decides on whether to transmit or not. We derive new closed-form expressions for the transmission probability, the connection outage probability, the secrecy outage probability, and the reliable and secure transmission probability to characterize the achievable performance. Based on these results, we present the optimal solutions that maximize the secrecy throughput under dual connection and secrecy outage constraints. Our analytical and numerical results offer detailed insights into the design of the wiretap coding parameters and the imposed outage constraints. We further show that allowing more freedom on the codeword transmission rate enables a larger feasible region of the dual outage constraints by exploiting the tradeoff between reliability and security.

IEEE Transactions on Vehicular Technology•Sep 10, 2015•49 citations

On the fading Gaussian wiretap channel with statistical channel state information at transmitter

Pin-Hsun Lin, Eduard Axel Jorswieck

In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.

IEEE Conference on Communications and Network Security•Oct 1, 2014•6 citations

Secure transmission over fast fading multiple-antenna Gaussian broadcast channel with confidential messages

Chien-Li Su, Pin-Hsun Lin, Hsuan-Jung Su

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at the transmitter, fully or partially. In practice, the eavesdropper may not be motivated to feedback correct CSI. In this paper we consider a more practical problem for the transmitter to have the eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where there are two receivers both legitimate and willing to feedback accurate CSI to the transmitter to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first derive the achievable rate region for the FMGBC-CM. After that we propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the proposed algorithm in terms of the convergence speed.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2013•0 citations

Low complexity precoding for MIMOME wiretap channels based on cut-off rate

Sina Rezaei Aghdam, Tolga M. Duman

We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•8 citations
This paper proposes secrecy-enhancing signaling schemes to exploit the advantages of having only channel state information (CSI) at the transmitter, but no (or limited) CSI at the receiver and the eavesdropper in fast-fading wiretap channels and also in wiretap channels with Gaussian interference. With only CSI at the transmitter, the transmit signaling can be designed to precompensate for the distortion or the interference on the main channel to facilitate decoding at the receiver while leaving the eavesdropper confused by the uncertainties of its own channel. In fading wiretap channels, truncated channel-inversion and phase-compensation schemes are proposed to achieve this task. Here, truncation is used so that transmission occurs only when the main channel is sufficiently reliable. In wiretap channels with Gaussian interference, a truncated interference-nulling scheme is proposed to enable interference precancellation at the transmitter. The proposed signaling schemes exploit the advantages of having only CSI at the transmitter without employing more complex encoding schemes. The achievable secrecy rates are derived using Gaussian input, and approximate expressions are proposed for the optimization of system parameters. The effectiveness of the proposed transmission schemes and the advantages of having only CSI at the transmitter are demonstrated through numerical simulations.
This work examines the advantages of having only channel state information at the transmitter (CSIT), and not at the receiver and the eavesdropper, when achieving secrecy in fading wiretap channels. The key idea is that, with only CSIT, the transmitter can pre-compensate for the amplitude and phase distortions on the main channel. This allows the receiver to decode coherently even without knowledge of the CSI, while leaving the eavesdropper confused by the unknown variations of its own channel. When the channel is reciprocal, this CSI assumption can be achieved in practice through reverse training, i.e., by having the receiver emit the training signal so that the transmitter can estimate the channel by itself. Two secrecy-enhancing transmission schemes are proposed to exploit the CSIT. The truncated channel inversion scheme is used when the receiver and the eavesdropper have no CSI available, and the truncated phase compensation scheme is adopted when they can practically measure the SNR. The achievable secrecy rates of these schemes are derived for both single-antenna and multi-antenna wireless fading scenarios. Numerical results show significant improvements in secrecy rate compared to the case with full CSI at all terminals.
A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter. Two broadcast schemes, based on superposition coding and embedded coding, respectively, are developed to encode information into a number of layers and use stochastic encoding to keep the corresponding information secret from an eavesdropper. The layers that can be successfully and securely transmitted are determined by the channel states to the legitimate receiver and the eavesdropper. The advantage of these broadcast approaches is that the transmitter does not need to know the CSI to the legitimate receiver and the eavesdropper, but the scheme still adapts to the channel states of the legitimate receiver and the eavesdropper. Three scenarios of block fading wiretap channels with stringent delay constraints are studied, in which either the legitimate receiver's channel, the eavesdropper's channel, or both channels are fading. For each scenario, the secrecy rate that can be achieved via the broadcast approach developed in this paper is derived, and the optimal power allocation over the layers (or the conditions on the optimal power allocation) is also characterized. A notion of probabilistic secrecy, which characterizes the probability that a certain secrecy rate of decoded messages is achieved during one block, is also introduced and studied for scenarios when the eavesdropper's channel is fading. Numerical examples are provided to demonstrate the impact of the CSI at the transmitter and the channel fluctuations of the eavesdropper on the average secrecy rate. These examples also demonstrate the advantage of the proposed broadcast approach over the compound channel approach.
We design new secure on-off transmission schemes in wiretap channels with outdated channel state information (CSI). In our design, we consider not only the outdated CSI from the legitimate receiver but two distinct scenarios as well, depending on whether the outdated CSI from the eavesdropper is known at the transmitter. Under this consideration, our schemes exploit useful knowledge contained in the available outdated CSI, and based on this, the transmitter decides on whether to transmit or not. We derive new closed-form expressions for the transmission probability, the connection outage probability, the secrecy outage probability, and the reliable and secure transmission probability to characterize the achievable performance. Based on these results, we present the optimal solutions that maximize the secrecy throughput under dual connection and secrecy outage constraints. Our analytical and numerical results offer detailed insights into the design of the wiretap coding parameters and the imposed outage constraints. We further show that allowing more freedom on the codeword transmission rate enables a larger feasible region of the dual outage constraints by exploiting the tradeoff between reliability and security.
In this paper we partially characterize the relation between the ergodic secrecy capacity of fast fading wiretap channels and the stochastic orders including the usual stochastic orders, the convex orders, and the increasing convex orders, of the main and eavesdropper's channels. We assume that there is only statistical channel state information of both channels at transmitter and both fading channels can be with arbitrary distributions. We derive the sufficient conditions for the existence of the positive ergodic secrecy capacity under these three orders. For more general orders we also derive capacity lower and upper bounds. To achieve it, we apply the concept of channel enhancement to the continuous fading wiretap channel and derive an upper bound. Motivated by the upper bound, we also derive the lower bound of the ergodic secrecy capacity by the layered signaling. Finally numerical results show that under Nakagami-m channels, the proposed achievable scheme outperforms Gaussian signaling in several cases. More specifically, the proposed scheme may result in positive secrecy rate while Gaussian signaling only lead to zero. Thus when we apply the proposed scheme to the wireless network, the connectivity can be significantly improved.
In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at the transmitter, fully or partially. In practice, the eavesdropper may not be motivated to feedback correct CSI. In this paper we consider a more practical problem for the transmitter to have the eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian broadcast channels (FMGBC-CM) with confidential messages, where there are two receivers both legitimate and willing to feedback accurate CSI to the transmitter to maintain their secure transmission, and not to be eavesdropped by the other. We assume that only the statistics of the channel state information are known by the transmitter. We first derive the achievable rate region for the FMGBC-CM. After that we propose an iterative algorithm to solve the channel input covariance matrices and the inflation factor. Finally, numerical examples show that under perfect secrecy constraint both users can achieve positive rates simultaneously, which verifies our derived necessary condition. Numerical results also elucidate the effectiveness of the proposed algorithm in terms of the convergence speed.
We propose a low complexity transmit signal design scheme for achieving information-theoretic secrecy over a MIMO wiretap channel driven by finite-alphabet inputs. We assume that the transmitter has perfect channel state information (CSI) of the main channel and also knows the statistics of the eavesdropper's channel. The proposed transmission scheme relies on jointly optimizing the precoder matrix and the artificial noise so as to maximize the achievable secrecy rates. In order to lower the computational complexity associated with the transmit signal design, we employ a design metric using the cut-off rate instead of the mutual information. We formulate a gradient-descent based optimization algorithm and demonstrate via extensive numerical examples that the proposed signal design scheme can yield an enhanced secrecy performance compared with the existing solutions in spite of its relatively lower computational complexity. The impacts of the modulation order as well as the number of antennas at the transmitter and receiver ends on the achievable secrecy rates are also investigated.