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

Secrecy rates of finite-input intersymbol interference channels

Serdar Hanoğlu

Published Oct 1, 2016• 1 citation
OpenAlex

Abstract

Due to the broadcast nature of the communication medium, security is a critical problem in wireless networks. Securing the transmission at the physical layer is a promising alternative or complement to the conventional higher level techniques such as encryption. During the past decade, various studies have been carried out which investigate such possibilities in providing secrecy for different scenarios. On the other hand, secrecy over intersymbol interference (ISI) channels has not received significant attention, and much work remains to be done. With this motivation, we focus on secrecy rates of finite-input ISI channels for both fixed and fading channel coefficients. We argue that the secrecy rates of ISI channels can be computed by the forward recursion of the BCJR algorithm. Moreover, by utilizing Markov input distributions for transmission over the ISI channels, achievable secrecy rates can be increased. However, the existing iterative method in the literature to obtain the optimal Markov input distribution is computationally complex as many BCJR recursions are needed. Thus, we propose an alternative solution by introducing a codebook based approach. Particularly, among the existing Markov input distributions in the codebook, we propose to select the one which spectrally matches the main channel. Our numerical results reveal that the proposed low complexity approach undergoes a minimal loss with respect to the existing iterative algorithm while offering a considerably reduced complexity. We also propose injection of artificial noise (AN) to increase the secrecy rates, and show that this is especially useful for moderate and high signal to noise ratio (SNR) values where the use of Markov input distributions is not beneficial. We inject AN to frequencies where the eavesdropper's channel is better than the main channel. We show that this approach significantly increases the secrecy rates compared to the existing methods. Furthermore, we consider the effect of channel state information (CSI) on the secrecy rates, and demonstrate that availability of eavesdropper's CSI at the transmitter is highly beneficial in terms of the achievable secrecy rates.

Related papers

Artificial-Noise-Aided Secure Transmission over Finite-Input Intersymbol Interference Channels

Serdar Hanoğlu, Sina Rezaei Aghdam, Tolga M. Duman

We propose an artificial noise (AN) injection strategy for securing communication over finite-input intersymbol interference (lSI) channels. The technique relies on injection of colored noise whose power spectral density has the least match with the spectrum of the main channel in a certain sense. By evaluation of an achievable secrecy rate, we demonstrate that the proposed AN injection based solution results in a considerable improvement over the existing approaches, especially when the eavesdropper works at high signal-to-noise ratios (SNRs).

•Jun 1, 2018•4 citations

Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels

Aria Nouri, Reza Asvadi, Jun Chen +1 more

We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first derive an achievable secure rate for ISI-WTCs without imposing any constraints on the input distribution. Afterwards, we focus on the setup where the input distribution of the ISI-WTC is constrained to be a time-invariant finite-order Markov chain. Optimizing the parameters of this Markov chain toward maximizing the achievable secure rates is a computationally intractable problem in general, and so, toward finding a local maximum, we propose an iterative algorithm that at every iteration replaces the secure rate function with a suitable surrogate function whose maximum can be found efficiently. Although the secure rates achieved in the unconstrained setup are potentially larger than the secure rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating and optimizing the achievable secure rates, and also has the benefit of being the basis of efficient coding schemes.

arXiv:2102.04941•IEEE Transactions on Communications•Mar 13, 2023•3 citations

Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. We present a method to exploit the eavesdropper's inherent receiver vulnerabilities to obtain everlasting secrecy. An ephemeral cryptographic key is pre-shared between the transmitter and the legitimate receiver and is utilized to induce intentional intersymbol interference (ISI). The legitimate receiver uses the key to cancel the ISI while the eavesdropper, since it does not have the key, cannot do such. It is shown that although ISI reduces the capacity of the main channel, it can lead to a net gain in secrecy rate. The achievable secrecy rates for different ISI filter settings are evaluated and the proposed method is compared with other information-theoretic security schemes.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•12 citations

Linear Precoding for Finite-Alphabet Signaling Over MIMOME Wiretap Channels

Yongpeng Wu, Chengshan Xiao, Zhi Jun Ding +2 more

In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.

IEEE Transactions on Vehicular Technology•Apr 20, 2012•128 citations

Secure multi-antenna transmission with finite-alphabet signaling

Sina Rezaei Aghdam

With the ever-growing demand for services that rely on transmission over wireless networks, a challenging issue is the security of the transmitted information. Due to its open nature, wireless communications is prone to eavesdropping attacks. Typically, secrecy of the transmitted information is ensured with the aid of cryptographic techniques, which are deployed on upper layers of the network protocol stack. However, due to the need for key distribution and management, cryptographic solutions are difficult to implement in decentralized networks. Moreover, the security provided by key based solutions is not provable from a mathematical point of view. Physical layer security is an alternative or complement to the cryptographic techniques, which can resolve the complexities associated with key distribution and management. The basic principle of physical layer security is to exploit the randomness of the communication channels to allow a transmitter deliver its message to an intended receiver reliably while guaranteeing that a third party cannot infer any information about it. Much of the existing research in physical layer security focuses on investigating the information theoretic limits of secure communications. Among different techniques proposed, multiple-antenna based solutions have been shown to exhibit a high potential for enhancing security. Furthermore, Gaussian inputs are proved to be the optimal input distributions in a variety of scenarios. However, due to the high detection complexity, Gaussian signaling is not used in practice, and the transmission is carried out with the aid of symbols drawn from standard signal constellations. In this thesis, we develop several secure multi-antenna transmission techniques under the practical finite-alphabet input assumption. We first consider multipleinput multiple-output (MIMO) wiretap channels under finite-alphabet input constraints. We assume that the statistical channel state information (CSI) of the eavesdropper is available at the transmitter, and study two different scenarios regarding the transmitter's knowledge on the main channel CSI (MCSI) including availability of perfect and statistical MCSI at the transmitter. In each scenario, we introduce iterative algorithms for joint optimization of data precoder and arti ficial noise. We also propose different strategies to reduce the computational complexity associated with the transmit signal design. Moreover, we consider the setups with simultaneous wireless information and power transfer (SWIPT), and propose transmission schemes for achieving the trade-off between the secrecy rate and the harvested power. We demonstrate the efficacy of the proposed transmit signal design algorithms via extensive numerical examples. We also introduce several secure transmission schemes with spatial modulation and space shift keying (SSK). We derive an expression for the achievable secrecy rate, and develop precoder optimization algorithms for its maximization using transmitter side CSI. Furthermore, we introduce a group of secure SSK transmission schemes, which rely on dynamic antenna index assignment over reciprocal channels. Our results reveal that the fundamentally different working principle of SSK opens up new avenues for secure multi-antenna transmission.

•Jan 1, 2018•1 citation

Physical-Layer Secrecy for OFDM Transmissions Over Fading Channels

Francesco Renna, Nicola Laurenti, H. Vincent Poor

This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. The secrecy capacity is formulated as a maximization problem under a trace constraint, and simple expressions are given for its high signal-to-noise (SNR) limit. The low rate limit of the secrecy outage probability is also evaluated under a fading channel model. As for the finite SNR case, the secrecy rates that can be achieved with particular inputs are considered. Numerical results are provided under a Rayleigh fading channel model and under dependence of the main and eavesdropper channels. The secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver, are also considered.

IEEE Transactions on Information Forensics and Security•Apr 20, 2012•98 citations
Due to the broadcast nature of the communication medium, security is a critical problem in wireless networks. Securing the transmission at the physical layer is a promising alternative or complement to the conventional higher level techniques such as encryption. During the past decade, various studies have been carried out which investigate such possibilities in providing secrecy for different scenarios. On the other hand, secrecy over intersymbol interference (ISI) channels has not received significant attention, and much work remains to be done. With this motivation, we focus on secrecy rates of finite-input ISI channels for both fixed and fading channel coefficients. We argue that the secrecy rates of ISI channels can be computed by the forward recursion of the BCJR algorithm. Moreover, by utilizing Markov input distributions for transmission over the ISI channels, achievable secrecy rates can be increased. However, the existing iterative method in the literature to obtain the optimal Markov input distribution is computationally complex as many BCJR recursions are needed. Thus, we propose an alternative solution by introducing a codebook based approach. Particularly, among the existing Markov input distributions in the codebook, we propose to select the one which spectrally matches the main channel. Our numerical results reveal that the proposed low complexity approach undergoes a minimal loss with respect to the existing iterative algorithm while offering a considerably reduced complexity. We also propose injection of artificial noise (AN) to increase the secrecy rates, and show that this is especially useful for moderate and high signal to noise ratio (SNR) values where the use of Markov input distributions is not beneficial. We inject AN to frequencies where the eavesdropper's channel is better than the main channel. We show that this approach significantly increases the secrecy rates compared to the existing methods. Furthermore, we consider the effect of channel state information (CSI) on the secrecy rates, and demonstrate that availability of eavesdropper's CSI at the transmitter is highly beneficial in terms of the achievable secrecy rates.
We propose an artificial noise (AN) injection strategy for securing communication over finite-input intersymbol interference (lSI) channels. The technique relies on injection of colored noise whose power spectral density has the least match with the spectrum of the main channel in a certain sense. By evaluation of an achievable secrecy rate, we demonstrate that the proposed AN injection based solution results in a considerable improvement over the existing approaches, especially when the eavesdropper works at high signal-to-noise ratios (SNRs).
We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first derive an achievable secure rate for ISI-WTCs without imposing any constraints on the input distribution. Afterwards, we focus on the setup where the input distribution of the ISI-WTC is constrained to be a time-invariant finite-order Markov chain. Optimizing the parameters of this Markov chain toward maximizing the achievable secure rates is a computationally intractable problem in general, and so, toward finding a local maximum, we propose an iterative algorithm that at every iteration replaces the secure rate function with a suitable surrogate function whose maximum can be found efficiently. Although the secure rates achieved in the unconstrained setup are potentially larger than the secure rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating and optimizing the achievable secure rates, and also has the benefit of being the basis of efficient coding schemes.
Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. We present a method to exploit the eavesdropper's inherent receiver vulnerabilities to obtain everlasting secrecy. An ephemeral cryptographic key is pre-shared between the transmitter and the legitimate receiver and is utilized to induce intentional intersymbol interference (ISI). The legitimate receiver uses the key to cancel the ISI while the eavesdropper, since it does not have the key, cannot do such. It is shown that although ISI reduces the capacity of the main channel, it can lead to a net gain in secrecy rate. The achievable secrecy rates for different ISI filter settings are evaluated and the proposed method is compared with other information-theoretic security schemes.
In this paper, we investigate the secrecy rate of finite-alphabet communications over multiple-input-multiple-output-multiple-antenna eavesdropper (MIMOME) channels. Traditional precoding designs based on Gaussian input assumption may lead to substantial secrecy rate loss when the Gaussian input is replaced by practical finite-alphabet input. To address this issue, we investigate linear precoding designs to directly maximize the secrecy rate for MIMOME systems under the constraint of finite-alphabet input. By exploiting the theory of Karush-Kuhn-Tucker (KKT) analysis and matrix calculus, we first present necessary conditions of the optimal precoding design when instantaneous channel-state information (CSI) of the eavesdropper is known at the transmitter. In this light, an iterative algorithm for finding the optimal precoding matrix is developed, utilizing a gradient decent method with backtracking line search. Moreover, we find that the beamforming design in MIMONE systems, which is a secrecy-capacity-achieving approach for Gaussian signaling, no longer provides the maximum secrecy rate for finite-alphabet input data. This case is substantially different from the Gaussian input case. In addition, we derive the closed-form results on the precoding matrix, which maximizes the secrecy rate in the low signal-to-noise ratio (SNR) region, and reveal the optimal precoding structure in the high-SNR region. A novel jamming signal generation method that draws on the CSI of the eavesdropper to additionally increase the secrecy rate is further proposed. The precoding design with only statistical CSI of the eavesdropper available at the transmitter is also considered. Numerical results show that the proposed designs provide significant gains over recent precoding designs through a power control policy and the precoding design with the Gaussian input assumption in various scenarios.
With the ever-growing demand for services that rely on transmission over wireless networks, a challenging issue is the security of the transmitted information. Due to its open nature, wireless communications is prone to eavesdropping attacks. Typically, secrecy of the transmitted information is ensured with the aid of cryptographic techniques, which are deployed on upper layers of the network protocol stack. However, due to the need for key distribution and management, cryptographic solutions are difficult to implement in decentralized networks. Moreover, the security provided by key based solutions is not provable from a mathematical point of view. Physical layer security is an alternative or complement to the cryptographic techniques, which can resolve the complexities associated with key distribution and management. The basic principle of physical layer security is to exploit the randomness of the communication channels to allow a transmitter deliver its message to an intended receiver reliably while guaranteeing that a third party cannot infer any information about it. Much of the existing research in physical layer security focuses on investigating the information theoretic limits of secure communications. Among different techniques proposed, multiple-antenna based solutions have been shown to exhibit a high potential for enhancing security. Furthermore, Gaussian inputs are proved to be the optimal input distributions in a variety of scenarios. However, due to the high detection complexity, Gaussian signaling is not used in practice, and the transmission is carried out with the aid of symbols drawn from standard signal constellations. In this thesis, we develop several secure multi-antenna transmission techniques under the practical finite-alphabet input assumption. We first consider multipleinput multiple-output (MIMO) wiretap channels under finite-alphabet input constraints. We assume that the statistical channel state information (CSI) of the eavesdropper is available at the transmitter, and study two different scenarios regarding the transmitter's knowledge on the main channel CSI (MCSI) including availability of perfect and statistical MCSI at the transmitter. In each scenario, we introduce iterative algorithms for joint optimization of data precoder and arti ficial noise. We also propose different strategies to reduce the computational complexity associated with the transmit signal design. Moreover, we consider the setups with simultaneous wireless information and power transfer (SWIPT), and propose transmission schemes for achieving the trade-off between the secrecy rate and the harvested power. We demonstrate the efficacy of the proposed transmit signal design algorithms via extensive numerical examples. We also introduce several secure transmission schemes with spatial modulation and space shift keying (SSK). We derive an expression for the achievable secrecy rate, and develop precoder optimization algorithms for its maximization using transmitter side CSI. Furthermore, we introduce a group of secure SSK transmission schemes, which rely on dynamic antenna index assignment over reciprocal channels. Our results reveal that the fundamentally different working principle of SSK opens up new avenues for secure multi-antenna transmission.
This paper considers the information theoretic secrecy rates that are achievable by an orthogonal frequency-division multiplexing (OFDM) transmitter/receiver pair in the presence of an eavesdropper that might either use an OFDM structure or choose a more complex receiver architecture. The analysis is made possible by modeling the system as a particular instance of a high dimensional multiple-input multiple-output wiretap channel. The secrecy capacity is formulated as a maximization problem under a trace constraint, and simple expressions are given for its high signal-to-noise (SNR) limit. The low rate limit of the secrecy outage probability is also evaluated under a fading channel model. As for the finite SNR case, the secrecy rates that can be achieved with particular inputs are considered. Numerical results are provided under a Rayleigh fading channel model and under dependence of the main and eavesdropper channels. The secrecy loss due to the OFDM structure constraints, and the information gain for an eavesdropper that uses a more complex receiver, are also considered.