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

Allerton Conference on Communication, Control, and Computing

On the relationship between the multi-antenna secrecy communications and cognitive radio communications

Lan Zhang, Rui Zhang, Ying‐Chang Liang, Yan Xin, Shuguang Robert Cui

Published Sep 1, 2009• 18 citations
Publisher

Abstract

This paper studies the achievable rates of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channel with multiple single-/multi-antenna eavesdroppers. It is known that the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by existing methods. To handle this difficulty, this paper explores a new relationship between the secrecy channel and the recently developed cognitive radio (CR) channel, in which the secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called ¿interference temperature (IT)¿ constraints. By constructing an auxiliary multi-antenna CR channel that has the same channel responses as the secrecy channel, this paper shows that the optimal transmit covariance to achieve the maximum secrecy rate is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Thereby, finding the optimal complex transmit covariance matrix for the secrecy channel becomes equivalent to searching over a set of real IT constraints in the auxiliary CR channel. Based on this relationship, efficient algorithms are proposed to solve the non-convex secrecy rate maximization problem by transforming it into a sequence of convex CR spectrum sharing capacity computation problems, under various setups of the secrecy channel.

DOI
10.1109/allerton.2009.5394527

Related papers

On the relationship between the multi-antenna secrecy communications and cognitive radio communications

Lan Zhang, Rui Zhang, Ying‐Chang Liang +2 more

This paper studies the achievable rates of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channel with multiple single-/multi-antenna eavesdroppers. By assuming Gaussian input, the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by existing methods. To handle this difficulty, this paper explores a new relationship between the secrecy channel and the recently developed cognitive radio (CR) channel, in which the secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called "interference temperature (IT)" constraints. By constructing an auxiliary multi-antenna CR channel that has the same channel responses as the secrecy channel, this paper shows that the optimal transmit covariance to achieve the maximum secrecy rate is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Thereby, finding the optimal complex transmit covariance matrix for the secrecy channel becomes equivalent to searching over a set of real IT constraints in the auxiliary CR channel. Based on this relationship, efficient algorithms are proposed to solve the non-convex secrecy rate maximization problem by transforming it into a sequence of convex CR spectrum sharing capacity computation problems, under various setups of the secrecy channel.

IEEE Transactions on Communications•Jun 1, 2010•102 citations

On the Relationship Between the Multi-antenna Secrecy Communications and Cognitive Radio Communications

Lan Zhang, Rui Zhang, Ying‐Chang Liang +2 more

This paper studies the capacity of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channels with multiple eavesdroppers having single/multiple antennas. It is known that the MIMO secrecy capacity is achievable with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The MIMO secrecy capacity computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by standard convex optimization techniques. To handle this difficulty, we explore a relationship between the MIMO secrecy channel and the recently developed MIMO cognitive radio (CR) channel, in which the multi-antenna secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called ``interference temperature (IT)'' constraints. By constructing an auxiliary CR MIMO channel that has the same channel responses as the MIMO secrecy channel, we prove that the optimal transmit covariance matrix to achieve the secrecy capacity is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Based on this relationship, several algorithms are proposed to solve the non-convex secrecy capacity computation problem by transforming it into a sequence of CR spectrum sharing capacity computation problems that are convex. For the case with single-antenna eavesdroppers, the proposed algorithms obtain the exact capacity of the MIMO secrecy channel, while for the case with multi-antenna eavesdroppers, the proposed algorithms obtain both upper and lower bounds on the MIMO secrecy capacity.

arXiv:0901.4830•Jan 30, 2009•1 citation

Secure communication over MISO cognitive radio channels

Yiyang Pei, Ying‐Chang Liang, Lan Zhang +2 more

In this paper, we address the physical-layer security issue of a secondary user (SU) in a spectrum-sharing cognitive radio network (CRN) from an information-theoretic perspective. Specially, we consider a secure multiple-input single-output (MISO) cognitive radio channel, where a multi-antenna SU transmitter (SU-Tx) sends confidential information to a legitimate SU receiver (SU-Rx) in the presence of an eavesdropper and on the licensed band of a primary user (PU). The secrecy capacity of the channel is characterized, which is a quasiconvex optimization problem of finding the capacity-achieving transmit covariance matrix under the joint transmit power and interference power constraints. Two numerical approaches are proposed to derive the optimal transmit covariance matrix. The first approach recasts the original quasiconvex problem into a single convex semidefinite program (SDP) by exploring its inherent convexity; while the second one explores the relationship between the secure CRN and the conventional CRN and transforms the original problem into a sequence of optimization problems associated with the conventional CRN, which helps to prove that beamforming is the optimal strategy for the secure MISO CR channel. In addition, to reduce the computational complexity, three suboptimal schemes are presented, namely, scaled secret beamforming (SSB), projected secret beamforming (PSB) and projected cognitive beamforming (PCB). Lastly, computer simulation results show that the three suboptimal schemes can approach the secrecy capacity well under certain conditions.

IEEE Transactions on Wireless Communications•Apr 1, 2010•208 citations

Closed-form solutions for optimal secure signaling over cognitive radio MIMO channels

Limeng Dong, Sergey L. Loyka, Yong Li

Secure signaling over multiple-input multiple-output (MIMO) channels (WTC) in cognitive radio (CR) systems is studied using the CR MIMO WTC model supplemented with the interference power constraint so that interference to the primary receiver (PR) does not exceed a threshold while ensuring simultaneously no information leakage to an eavesdropper. Based on the recent secrecy capacity results, a number of closed-form analytical solutions for optimal secure signalling (transmit covariance matrix) are established, along with related properties and bounds. This complements known results for the single-antenna (MISO) case as well as numerical algorithms developed in the literature for the general case.

IEEE Global Conference on Signal and Information Processing•Nov 1, 2017•1 citation

The operational secrecy capacity of cognitive radio MIMO channel

Limeng Dong, Sergey L. Loyka, Y. Li

Secure communications over cognitive radio (CR) MIMO channels is studied. The secrecy capacity, defined operationally as the maximum achievable secrecy rate subject to reliability and secrecy constraints, of CR MIMO wiretap channel is established under power and interference constraints, including a number of closed-form expressions, bounds and related properties. The secrecy capacity of this channel can be expressed as a minimax game between the transmitter (who selects the input covariance) and nature (who selects the noise covariance). Neither player can deviate from an optimal strategy without incurring a penalty.

Canadian Workshop on Information Theory (CWIT)•Jun 1, 2017•4 citations

Improved Transmit Design for Physical Layer Security in Cognitive Radio Networks with Multiple Eavesdropper Base on Semi-definite Programming

Xianzhong Xie, Xie Cheng-jing, Weijia Lei +1 more

In the Cognitive Radio Network (CRN) with multiple multi-antenna eavesdroppers, to make the system security rate maximum, secure communication over the physical layer that is subjected to the interference power constraints at the Primary Users (PU) is provided by designing the transmit covariance optimization of Secondary User Transmitter (SU-Tx).When?the?Channel State?Information (CSI) is known, the properties of the matrices and Charnes-Cooper transformation are used, the non-convex function is converted to a Semi-Definite Programming (SDP) to get the optimization scheme of SU-Tx. Simulation results show that compared with the existing sub-optimal transmission designs, the proposed method improves the secrecy rate and has more advantages on the complexity.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Oct 19, 2015•1 citation
This paper studies the achievable rates of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channel with multiple single-/multi-antenna eavesdroppers. It is known that the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by existing methods. To handle this difficulty, this paper explores a new relationship between the secrecy channel and the recently developed cognitive radio (CR) channel, in which the secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called ¿interference temperature (IT)¿ constraints. By constructing an auxiliary multi-antenna CR channel that has the same channel responses as the secrecy channel, this paper shows that the optimal transmit covariance to achieve the maximum secrecy rate is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Thereby, finding the optimal complex transmit covariance matrix for the secrecy channel becomes equivalent to searching over a set of real IT constraints in the auxiliary CR channel. Based on this relationship, efficient algorithms are proposed to solve the non-convex secrecy rate maximization problem by transforming it into a sequence of convex CR spectrum sharing capacity computation problems, under various setups of the secrecy channel.
This paper studies the achievable rates of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channel with multiple single-/multi-antenna eavesdroppers. By assuming Gaussian input, the maximum achievable secrecy rate is obtained with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The maximum secrecy rate computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by existing methods. To handle this difficulty, this paper explores a new relationship between the secrecy channel and the recently developed cognitive radio (CR) channel, in which the secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called "interference temperature (IT)" constraints. By constructing an auxiliary multi-antenna CR channel that has the same channel responses as the secrecy channel, this paper shows that the optimal transmit covariance to achieve the maximum secrecy rate is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Thereby, finding the optimal complex transmit covariance matrix for the secrecy channel becomes equivalent to searching over a set of real IT constraints in the auxiliary CR channel. Based on this relationship, efficient algorithms are proposed to solve the non-convex secrecy rate maximization problem by transforming it into a sequence of convex CR spectrum sharing capacity computation problems, under various setups of the secrecy channel.
This paper studies the capacity of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channels with multiple eavesdroppers having single/multiple antennas. It is known that the MIMO secrecy capacity is achievable with the optimal transmit covariance matrix that maximizes the minimum difference between the channel mutual information of the secrecy user and those of the eavesdroppers. The MIMO secrecy capacity computation can thus be formulated as a non-convex max-min problem, which cannot be solved efficiently by standard convex optimization techniques. To handle this difficulty, we explore a relationship between the MIMO secrecy channel and the recently developed MIMO cognitive radio (CR) channel, in which the multi-antenna secondary user transmits over the same spectrum simultaneously with multiple primary users, subject to the received interference power constraints at the primary users, or the so-called ``interference temperature (IT)'' constraints. By constructing an auxiliary CR MIMO channel that has the same channel responses as the MIMO secrecy channel, we prove that the optimal transmit covariance matrix to achieve the secrecy capacity is the same as that to achieve the CR spectrum sharing capacity with properly selected IT constraints. Based on this relationship, several algorithms are proposed to solve the non-convex secrecy capacity computation problem by transforming it into a sequence of CR spectrum sharing capacity computation problems that are convex. For the case with single-antenna eavesdroppers, the proposed algorithms obtain the exact capacity of the MIMO secrecy channel, while for the case with multi-antenna eavesdroppers, the proposed algorithms obtain both upper and lower bounds on the MIMO secrecy capacity.
In this paper, we address the physical-layer security issue of a secondary user (SU) in a spectrum-sharing cognitive radio network (CRN) from an information-theoretic perspective. Specially, we consider a secure multiple-input single-output (MISO) cognitive radio channel, where a multi-antenna SU transmitter (SU-Tx) sends confidential information to a legitimate SU receiver (SU-Rx) in the presence of an eavesdropper and on the licensed band of a primary user (PU). The secrecy capacity of the channel is characterized, which is a quasiconvex optimization problem of finding the capacity-achieving transmit covariance matrix under the joint transmit power and interference power constraints. Two numerical approaches are proposed to derive the optimal transmit covariance matrix. The first approach recasts the original quasiconvex problem into a single convex semidefinite program (SDP) by exploring its inherent convexity; while the second one explores the relationship between the secure CRN and the conventional CRN and transforms the original problem into a sequence of optimization problems associated with the conventional CRN, which helps to prove that beamforming is the optimal strategy for the secure MISO CR channel. In addition, to reduce the computational complexity, three suboptimal schemes are presented, namely, scaled secret beamforming (SSB), projected secret beamforming (PSB) and projected cognitive beamforming (PCB). Lastly, computer simulation results show that the three suboptimal schemes can approach the secrecy capacity well under certain conditions.
Secure signaling over multiple-input multiple-output (MIMO) channels (WTC) in cognitive radio (CR) systems is studied using the CR MIMO WTC model supplemented with the interference power constraint so that interference to the primary receiver (PR) does not exceed a threshold while ensuring simultaneously no information leakage to an eavesdropper. Based on the recent secrecy capacity results, a number of closed-form analytical solutions for optimal secure signalling (transmit covariance matrix) are established, along with related properties and bounds. This complements known results for the single-antenna (MISO) case as well as numerical algorithms developed in the literature for the general case.
Secure communications over cognitive radio (CR) MIMO channels is studied. The secrecy capacity, defined operationally as the maximum achievable secrecy rate subject to reliability and secrecy constraints, of CR MIMO wiretap channel is established under power and interference constraints, including a number of closed-form expressions, bounds and related properties. The secrecy capacity of this channel can be expressed as a minimax game between the transmitter (who selects the input covariance) and nature (who selects the noise covariance). Neither player can deviate from an optimal strategy without incurring a penalty.
In the Cognitive Radio Network (CRN) with multiple multi-antenna eavesdroppers, to make the system security rate maximum, secure communication over the physical layer that is subjected to the interference power constraints at the Primary Users (PU) is provided by designing the transmit covariance optimization of Secondary User Transmitter (SU-Tx).When?the?Channel State?Information (CSI) is known, the properties of the matrices and Charnes-Cooper transformation are used, the non-convex function is converted to a Semi-Definite Programming (SDP) to get the optimization scheme of SU-Tx. Simulation results show that compared with the existing sub-optimal transmission designs, the proposed method improves the secrecy rate and has more advantages on the complexity.