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 Information Theory Workshop (ITW)

Finite-Input Intersymbol Interference Wiretap Channels

Aria Nouri, Reza Asvadi, Jun Chen, Pascal O. Vontobel

Published Oct 17, 2021• 3 citations
Publisher

Abstract

We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first examine the setup where the source at the input of an ISI-WTC is unconstrained and then, based on a general achievability result for arbitrary wiretap channels, we derive an achievable secure rate for this ISI-WTC. Afterwards, we examine the setup where the source at the input of an ISI-WTC is constrained to be a finite-state machine source (FSMS) of a certain order and structure. optimizing the parameters of this FSMS toward maximizing the secure rate 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 by a suitable surrogate function whose maximum can be found efficiently.

DOI
10.1109/itw48936.2021.9611416

Related papers

Constrained Secrecy Capacity of Partial-Response Wiretap Channels.

Aria Nouri, Reza Asvadi, Jun Chen +1 more

We consider reliable and secure communication over partial-response wiretap channels (PR-WTCs). In particular, we first examine the setup where the source at the input of a PR-WTC is unconstrained and then, based on a general achievability result for arbitrary wiretap channels, we derive an achievable secure information rate for this PR-WTC. Afterwards, we examine the setup where the source at the input of a PR-WTC is constrained to be a finite-state machine source (FSMS) of a certain order and structure. Optimizing the parameters of this FSMS toward maximizing the secure information rate 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 information rate function by a suitable surrogate function whose maximum can be found efficiently. Although we expect the secure information rates achieved in the unconstrained setup to be larger than the secure information rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating achievable secure rates and also has the benefit of being the basis of efficient encoding and decoding schemes.

•Feb 9, 2021•0 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

MIMO wiretap channel with ISI heterogeneity — Achieving secure DoF with no CSI

Jean de Dieu Mutangana, Deepak Kumar, Ravi Tandon

We consider the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in which a transmitter (Alice) wishes to securely communicate with a receiver (Bob) in presence of an eavesdropper (Eve). We focus on the practically relevant setting in which there is no channel state information (CSI) at Alice about either of the channels to Bob or Eve, except statistical information about the ISI channels (i.e., Alice only knows the effective number of ISI taps). The key contribution of this work is to show that even with no CSI at Alice, positive secure degrees of freedom (SDoF) are achievable by carefully exploiting a) the heterogeneity of the ISI links to Bob and Eve, and b) the relative number of antennas at all the three terminals. To this end, we propose a novel achievable scheme that carefully mixes information and artificial noise symbols in order to exploit ISI heterogeneity to achieve positive SDoF. To the best of our knowledge, this is the first work to explore the idea of exploiting ISI channel length heterogeneity to achieve positive SDoF for the MIMO wiretap channel with no CSI at the legitimate transmitter.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Oct 1, 2017•4 citations

Secrecy rates of finite-input intersymbol interference channels

Serdar Hanoğlu

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.

•Oct 1, 2016•1 citation

Finite-state wiretap channels: Secrecy under memory constraints

Yogesh Sankarasubramaniam, Andrew Thangaraj, Kapali Viswanathan

Information-theoretic security offered by the wiretap channel model has been extensively studied for various scenarios recently. One scenario that has not received much attention is secrecy for systems with memory in the form of input constraints or inter-symbol interference (ISI). In this work, we consider finite state wiretap channels (FSWCs), which model the scenario of secrecy with memory. Using results on secrecy capacity for arbitrary wiretap channels, we first arrive at the secrecy capacity of a FSWC. Then, we develop a stochastic algorithm for computing tight lower bounds on the secrecy capacity of a less-noisy FSWC, and illustrate the computation through examples. Our results provide numerical comparisons between secrecy capacities with and without memory, and provide specific targets for code design.

IEEE Information Theory Workshop (ITW)•Jan 1, 2009•14 citations

On secure computation over the binary modulo-2 adder multiple-access wiretap channel

Mario Goldenbaum, Holger Boche, H. Vincent Poor

In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matches the algebraic structure of the channel and the joint source distribution fulfills certain conditions, the secrecy computation-capacity equals the computation capacity, which is the supremum of all achievable computation rates without secrecy constraints. Unlike the case of securely transmitting messages, no additional randomness is needed at the encoders nor does the legitimate receiver need any advantage over the eavesdropper. The results therefore show that the problem of securely computing a function over a multiple-access wiretap channel may significantly differ from the one of securely communicating messages.

arXiv:1603.07227•IEEE Information Theory Workshop (ITW)•Sep 1, 2016•11 citations
We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first examine the setup where the source at the input of an ISI-WTC is unconstrained and then, based on a general achievability result for arbitrary wiretap channels, we derive an achievable secure rate for this ISI-WTC. Afterwards, we examine the setup where the source at the input of an ISI-WTC is constrained to be a finite-state machine source (FSMS) of a certain order and structure. optimizing the parameters of this FSMS toward maximizing the secure rate 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 by a suitable surrogate function whose maximum can be found efficiently.
We consider reliable and secure communication over partial-response wiretap channels (PR-WTCs). In particular, we first examine the setup where the source at the input of a PR-WTC is unconstrained and then, based on a general achievability result for arbitrary wiretap channels, we derive an achievable secure information rate for this PR-WTC. Afterwards, we examine the setup where the source at the input of a PR-WTC is constrained to be a finite-state machine source (FSMS) of a certain order and structure. Optimizing the parameters of this FSMS toward maximizing the secure information rate 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 information rate function by a suitable surrogate function whose maximum can be found efficiently. Although we expect the secure information rates achieved in the unconstrained setup to be larger than the secure information rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating achievable secure rates and also has the benefit of being the basis of efficient encoding and decoding schemes.
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.
We consider the multiple-input multiple-output (MIMO) wiretap channel with intersymbol interference (ISI) in which a transmitter (Alice) wishes to securely communicate with a receiver (Bob) in presence of an eavesdropper (Eve). We focus on the practically relevant setting in which there is no channel state information (CSI) at Alice about either of the channels to Bob or Eve, except statistical information about the ISI channels (i.e., Alice only knows the effective number of ISI taps). The key contribution of this work is to show that even with no CSI at Alice, positive secure degrees of freedom (SDoF) are achievable by carefully exploiting a) the heterogeneity of the ISI links to Bob and Eve, and b) the relative number of antennas at all the three terminals. To this end, we propose a novel achievable scheme that carefully mixes information and artificial noise symbols in order to exploit ISI heterogeneity to achieve positive SDoF. To the best of our knowledge, this is the first work to explore the idea of exploiting ISI channel length heterogeneity to achieve positive SDoF for the MIMO wiretap channel with no CSI at the legitimate transmitter.
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.
Information-theoretic security offered by the wiretap channel model has been extensively studied for various scenarios recently. One scenario that has not received much attention is secrecy for systems with memory in the form of input constraints or inter-symbol interference (ISI). In this work, we consider finite state wiretap channels (FSWCs), which model the scenario of secrecy with memory. Using results on secrecy capacity for arbitrary wiretap channels, we first arrive at the secrecy capacity of a FSWC. Then, we develop a stochastic algorithm for computing tight lower bounds on the secrecy capacity of a less-noisy FSWC, and illustrate the computation through examples. Our results provide numerical comparisons between secrecy capacities with and without memory, and provide specific targets for code design.
In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matches the algebraic structure of the channel and the joint source distribution fulfills certain conditions, the secrecy computation-capacity equals the computation capacity, which is the supremum of all achievable computation rates without secrecy constraints. Unlike the case of securely transmitting messages, no additional randomness is needed at the encoders nor does the legitimate receiver need any advantage over the eavesdropper. The results therefore show that the problem of securely computing a function over a multiple-access wiretap channel may significantly differ from the one of securely communicating messages.