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 Capacity and Achievable Secrecy Rate of ISAC Systems Over Multi-Antenna Wiretap Channels Under Sensing SCNR Constraint

Zengbao Zhu, Qimei Cui, Yuming Huang, Xiaofang Zhao, Guoshun Nan, Na Li, Xiaofeng Tao, Ping Zhang

Published Jan 1, 2026• 0 citations
Publisher

Abstract

This paper investigates the fundamental secrecy capacity and achievable secrecy rate of multi-antenna integrated sensing and communication (ISAC) systems. A multi-antenna transmitter simultaneously delivers confidential messages to a single-antenna communication receiver and emits signals for target detection by a multi-antenna sensing receiver in signal-dependent clutter. The signal-to-clutter-plus-noise ratio (SCNR) is adopted as a general sensing performance metric. We model the system as a multi-antenna wiretap channel with the channel input subject to both SCNR and total power constraints. Secrecy capacity is derived based on the generalized secrecy capacity under the compact input covariance constraint and Stewart’s perturbation theory. Efficient iterative methods are developed to maximize the secrecy capacity and the achievable secrecy rate of the unified sensing and communication (S&C) signals. We prove for the first time that a dual-functional sensing-communication signal superposed with a deterministic sensing signal achieves capacity, where the communication receiver entities employ interference cancellation to eliminate interference from the deterministic sensing signal. Numerical results validate the effectiveness of our methods and analysis. The capacity-achieving signaling improves the secrecy rate by 10.47%, 34.55%, and 51.74%, compared to the DFAN scheme, the NOMA-inspired signaling, and the unified S&C signaling, respectively.

DOI
10.1109/twc.2026.3751727

Related papers

Secure Transmission for MISO Integrated Sensing and Communication Secrecy Systems

Yajie Zhang, Zengbao Zhu, Qimei Cui +2 more

Integrated Sensing and Communication (ISAC) can reuse the same spectrum and hardware resources for communication and radar sensing, which is a promising technology to alleviate spectrum congestion. Recently, there has been an increasing research interest in the physical layer secrecy aspects of ISAC systems. This paper studies a basic multiple-input single-output ISAC secrecy system, where a multi-antenna base station transmits a unified signal to sense a point target and communicate to a single-antenna receiver in the presence of$K$single antenna eavesdroppers. Under this setup, a sensing signal-to-noise ratio (SNR) constrained secrecy rate maximization problem has been formulated. We showed that the problem can be reformulated as a convex semidefinite programming problem and proved that beamforming is the optimal transmission scheme. We derived two low-complexity semiclosed-form optimal beamforming solutions and one suboptimal closed-form solution. Numerical results demonstrate that the proposed solutions attain the optimum of the sensing SNR constrained secrecy rate maximization problem and have lower computational complexity than the existing method.

International Conference on Communications•Jun 9, 2024•6 citations

Secrecy Rate- Distortion Tradeoff for Integrated Sensing and Communication With an Untrusted Sensing Node

Qi Gong, Yao Liu, Min Li +1 more

Integrated sensing and communication (ISAC) tech-nology combines communication and sensing functionalities through a unified signal waveform. While this integration offers potential benefits such as improved spectrum sharing and reduced processing costs, it also poses security challenges. Specifically, when the communication receiver and sensing entity operate as separate nodes, maintaining message secrecy from the sensing entity becomes crucial. To address this challenge, we propose a two-receiver state-dependent ISAC model that includes an untrusted sensing node. In this model, the ISAC transmitter aims to convey a message to the communication receiver while enabling the sensing of channel state for an untrusted sensing receiver, all while keeping the message secret from the untrusted sensing receiver. We consider the fundamental tradeoff between secure communication rate and sensing distortion within this model, which is characterized by the secrecy capacity-distortion function. To establish an inner bound on the secrecy capacity-distortion tradeoff region, we adopt an input-constrained wiretap coding approach. In addition, we present an outer bound on the tradeoff region by independently deriving the necessary conditions on the rate and on the sensing distortion. We also provide two illustrative examples that highlight the utilities of these bounds and demonstrate the superiority of the unified signal waveform over a separation-based approach via time-sharing.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 24, 2024•4 citations

On Secrecy Rate Analysis of MIMO Wiretap Channels Driven by Finite-Alphabet Input

Shafi Bashar, Zhi Jun Ding, Chengshan Xiao

This work investigates the effect of finite-alphabet input constraint on the secrecy rate of a multi-antenna wiretap channel. Most existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based on Gaussian source signals and secrecy code. For practical considerations, we study the effect of finite discrete-constellation on the achievable secrecy rate of multiple-antenna wire-tap channels. Our proposed precoding scheme converts the underlying multi-antenna system into a bank of parallel channels. Based on this precoding strategy, we develop a decentralized power allocation algorithm based on dual decomposition to maximize the achievable secrecy rate. In addition, we analyze the achievable secrecy rate for finite-alphabet inputs in low and high SNR regions. Our results demonstrate substantial difference in secrecy rate between systems given finite-alphabet inputs and systems with Gaussian inputs.

arXiv:1104.1014•IEEE Transactions on Communications•Sep 21, 2012•67 citations

On the ergodic secrecy rate of multiple-antenna wiretap channels using artificial noise and finite-rate feedback

Liang Sun, Shi Jin

We consider the problem of secure communication in wireless fading channels in the presence of quantized version of the receivers channel sate information at transmit side. The transmitter has multiple antennas and is able to simultaneously transmits an information bearing signal and artificial noise. For general values of signal to noise ratio (SNR), we obtain the exact closed-form expression for the distribution function of output signal to interference plus noise ratio at the legitimate receiver and a lower bound of the ergodic secrecy capacity can be obtain by using simple numerical integration. For the interference-limited case, we obtained a closed-form expression for a lower bound of secrecy capacity. Our results apply to arbitrary number of antennas and number of feedback bits. The analytical and numerical results show that the ergodic secrecy capacity lower bound approaches to a constant as the SNR of system grows large. In addition, we find that, for system with reasonable number of feedback bits, the optimal power allocation strategy should allocate most of the available power to the information signal.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2011•9 citations

Average secrecy rate under transmit antenna selection for the multiple-antenna wiretap channel

Nayeema Sadeque, Ingmar Land, Ramanan Subramanian

This paper presents an investigation of employing transmit antenna selection under secrecy constraints. The transmitter is equipped with multiple antennas while the intended receiver and the eavesdropper have a single antenna each. Instantaneous channel state information of the intended receiver and the eavesdropper are assumed to be available at the transmitter. We derive an analytical expression for the average secrecy rate, in terms of the number of available transmit antennas and the average signal-to-noise ratios at the intended receiver and the eavesdropper. We compare the performance of the antenna selection scheme, as revealed by our analysis, to a precoding scheme based on Generalized Singular Value Decomposition (GSVD) and characterize the loss in the secrecy capacity. In addition, we also derive an expression for the average secrecy capacity for the high SNR regime. From our investigation of the proposed system, we find that the increase of the average secrecy rate with the number of transmit antennas is sub-logarithmic.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2013•8 citations

The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel

Ersen Ekrem, Şennur Ulukuş

In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.

arXiv:0903.3096•IEEE Transactions on Information Theory•Mar 15, 2011•240 citations
This paper investigates the fundamental secrecy capacity and achievable secrecy rate of multi-antenna integrated sensing and communication (ISAC) systems. A multi-antenna transmitter simultaneously delivers confidential messages to a single-antenna communication receiver and emits signals for target detection by a multi-antenna sensing receiver in signal-dependent clutter. The signal-to-clutter-plus-noise ratio (SCNR) is adopted as a general sensing performance metric. We model the system as a multi-antenna wiretap channel with the channel input subject to both SCNR and total power constraints. Secrecy capacity is derived based on the generalized secrecy capacity under the compact input covariance constraint and Stewart’s perturbation theory. Efficient iterative methods are developed to maximize the secrecy capacity and the achievable secrecy rate of the unified sensing and communication (S&C) signals. We prove for the first time that a dual-functional sensing-communication signal superposed with a deterministic sensing signal achieves capacity, where the communication receiver entities employ interference cancellation to eliminate interference from the deterministic sensing signal. Numerical results validate the effectiveness of our methods and analysis. The capacity-achieving signaling improves the secrecy rate by 10.47%, 34.55%, and 51.74%, compared to the DFAN scheme, the NOMA-inspired signaling, and the unified S&C signaling, respectively.
Integrated Sensing and Communication (ISAC) can reuse the same spectrum and hardware resources for communication and radar sensing, which is a promising technology to alleviate spectrum congestion. Recently, there has been an increasing research interest in the physical layer secrecy aspects of ISAC systems. This paper studies a basic multiple-input single-output ISAC secrecy system, where a multi-antenna base station transmits a unified signal to sense a point target and communicate to a single-antenna receiver in the presence ofKKKsingle antenna eavesdroppers. Under this setup, a sensing signal-to-noise ratio (SNR) constrained secrecy rate maximization problem has been formulated. We showed that the problem can be reformulated as a convex semidefinite programming problem and proved that beamforming is the optimal transmission scheme. We derived two low-complexity semiclosed-form optimal beamforming solutions and one suboptimal closed-form solution. Numerical results demonstrate that the proposed solutions attain the optimum of the sensing SNR constrained secrecy rate maximization problem and have lower computational complexity than the existing method.
Integrated sensing and communication (ISAC) tech-nology combines communication and sensing functionalities through a unified signal waveform. While this integration offers potential benefits such as improved spectrum sharing and reduced processing costs, it also poses security challenges. Specifically, when the communication receiver and sensing entity operate as separate nodes, maintaining message secrecy from the sensing entity becomes crucial. To address this challenge, we propose a two-receiver state-dependent ISAC model that includes an untrusted sensing node. In this model, the ISAC transmitter aims to convey a message to the communication receiver while enabling the sensing of channel state for an untrusted sensing receiver, all while keeping the message secret from the untrusted sensing receiver. We consider the fundamental tradeoff between secure communication rate and sensing distortion within this model, which is characterized by the secrecy capacity-distortion function. To establish an inner bound on the secrecy capacity-distortion tradeoff region, we adopt an input-constrained wiretap coding approach. In addition, we present an outer bound on the tradeoff region by independently deriving the necessary conditions on the rate and on the sensing distortion. We also provide two illustrative examples that highlight the utilities of these bounds and demonstrate the superiority of the unified signal waveform over a separation-based approach via time-sharing.
This work investigates the effect of finite-alphabet input constraint on the secrecy rate of a multi-antenna wiretap channel. Most existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based on Gaussian source signals and secrecy code. For practical considerations, we study the effect of finite discrete-constellation on the achievable secrecy rate of multiple-antenna wire-tap channels. Our proposed precoding scheme converts the underlying multi-antenna system into a bank of parallel channels. Based on this precoding strategy, we develop a decentralized power allocation algorithm based on dual decomposition to maximize the achievable secrecy rate. In addition, we analyze the achievable secrecy rate for finite-alphabet inputs in low and high SNR regions. Our results demonstrate substantial difference in secrecy rate between systems given finite-alphabet inputs and systems with Gaussian inputs.
We consider the problem of secure communication in wireless fading channels in the presence of quantized version of the receivers channel sate information at transmit side. The transmitter has multiple antennas and is able to simultaneously transmits an information bearing signal and artificial noise. For general values of signal to noise ratio (SNR), we obtain the exact closed-form expression for the distribution function of output signal to interference plus noise ratio at the legitimate receiver and a lower bound of the ergodic secrecy capacity can be obtain by using simple numerical integration. For the interference-limited case, we obtained a closed-form expression for a lower bound of secrecy capacity. Our results apply to arbitrary number of antennas and number of feedback bits. The analytical and numerical results show that the ergodic secrecy capacity lower bound approaches to a constant as the SNR of system grows large. In addition, we find that, for system with reasonable number of feedback bits, the optimal power allocation strategy should allocate most of the available power to the information signal.
This paper presents an investigation of employing transmit antenna selection under secrecy constraints. The transmitter is equipped with multiple antennas while the intended receiver and the eavesdropper have a single antenna each. Instantaneous channel state information of the intended receiver and the eavesdropper are assumed to be available at the transmitter. We derive an analytical expression for the average secrecy rate, in terms of the number of available transmit antennas and the average signal-to-noise ratios at the intended receiver and the eavesdropper. We compare the performance of the antenna selection scheme, as revealed by our analysis, to a precoding scheme based on Generalized Singular Value Decomposition (GSVD) and characterize the loss in the secrecy capacity. In addition, we also derive an expression for the average secrecy capacity for the high SNR regime. From our investigation of the proposed system, we find that the increase of the average secrecy rate with the number of transmit antennas is sub-logarithmic.
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.