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 Signal Processing Letters

Secure Degree of Freedom Bound of Secret-Key Capacity for Two-Way Wiretap Channel

Qingpeng Liang, Linsong Du, Yanzhi Wu, Zheng Ma

Published Jan 1, 2025• 1 citation
Publisher

Abstract

This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.

DOI
10.1109/lsp.2024.3525406

Related papers

On the SDoF for Multiple Full-Duplex MIMO Users Pair-Wise Communications

Qingpeng Liang, Linsong Du, Meng Hua +1 more

This paper explores the pair-wise secure degree of freedom (SDoF) of a network with multiple full-duplex multiple-input multiple-output nodes, where the nodes communicate with each other while being wiretapped by a multi-antenna eavesdropper. This paper aims to fill the gap in the theoretical analysis of the optimal pair-wise SDoF of multiple full-duplex node systems from an information theory perspective when the channel state information remains unknown to each node at the beginning of the coherence interval. To this end, we first derive an upper bound of the achievable SDoF of the system using the optimal signal structure of the pair-wise secrecy rate. Then, by demonstrating that the upper bound is achievable using Gaussian signals, the optimal SDoF of the system is derived. The numerical results verify that the obtained optimal pair-wise SDoF extends the existing research with two legitimate nodes and increases the optimal SDoF by adjusting the number of out-of-pair transmit antennas appropriately.

IEEE Transactions on Vehicular Technology•Mar 24, 2025•1 citation

Secure Degrees of Freedom of MIMO Two-Way Wiretap Channel With no CSI Anywhere

Qingpeng Liang, Donglin Liu, Jiangping Hu

This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.

IEEE Transactions on Wireless Communications•Aug 25, 2020•9 citations

Secure Degree of Freedom of Wireless Networks Using Collaborative Pilots

Yingbo Hua, Qingpeng Liang, Md Saydur Rahman

A wireless network of full-duplex nodes/users, using anti-eavesdropping channel estimation (ANECE) based on collaborative pilots, can yield a positive secure degree-of-freedom (SDoF) regardless of the number of antennas an eavesdropper may have. This paper presents novel results on SDoF of ANECE by analyzing secret-key capacity (SKC) of each pair of nodes in a network of multiple collaborative nodes per channel coherence period. Each transmission session of ANECE has two phases: phase 1 is used for pilots, and phase 2 is used for random symbols. This results in two parts of SDoF of ANECE. Both lower and upper bounds on the SDoF of ANECE for any number of users are shown, and the conditions for the two bounds to meet are given. This leads to important discoveries, including: a) The phase-1 SDoF is the same for both multi-user ANECE and pair-wise ANECE while the former may require only a fraction of the number of time slots needed by the latter; b) For a three-user network, the phase-2 SDoF of all-user ANECE is generally larger than that of pair-wise ANECE; c) For a two-user network, a modified ANECE deploying square-shaped nonsingular pilot matrices yields a higher total SDoF than the original ANECE. The multi-user ANECE and the modified two-user ANECE shown in this paper appear to be the best full-duplex schemes known today in terms of SDoF subject to each node using a given number of antennas for both transmitting and receiving.

arXiv:2309.12502•IEEE Transactions on Signal Processing•Jan 1, 2023•5 citations

On the secure Degrees of Freedom for the K-user symmetric MIMO Wiretap MAC channel

Ahmed Bendary, Yahya Z. Mohasseb, Hisham Dahshan

We derive an upper bound for the sum secure Degrees of Freedom (sDoF) for the symmetric K-user MIMO Wiretap Multiple Access channel with full channel state information at transmitters (CSIT) but without the knowledge of eavesdroppers channel state information (CSI). We consider the symmetric case with K transmitters each equipped with M antennas, a base station with N antennas and an unknown number of eavesdroppers. Without assuming knowledge of the number (or location) of eavesdroppers, we assume that each eavesdropper has a maximum of Neantennas. The sum sDoF is shown to be upper bounded by Ds= min(max(M, N) - Ne/K, K M - Ne, N). Achievable schemes utilizing cooperative artificial noise transmission and zero-forcing decorrelators are shown to achieve the upper bound for a wide range of values of N/M.

IEEE Conference on Communications and Network Security•Oct 1, 2016•2 citations

Secrecy for MIMO wiretap and MIMO broadcast channels with fading eavesdroppers: CSI does not increase the secure DoF

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)•Aug 1, 2015•6 citations

Secure Degrees of Freedom of User Rank-Deficient Multiple Access Wiretap Channel

Hongtao Luo, Qiang Wang, Jingyi Chen

In this study, we investigate a two-user multiple-input multiple-output (MIMO) multiple access wiretap channel, in which the channel matrices of users exhibit rank deficiency. In this model, the legitimate transmitters and receiver are equipped with$M$and$N$antennas, respectively, while the eavesdropper has$K$antennas. The channel matrices of legitimate users are rank-deficient, whereas those between transmitters and the eavesdropper are full-rank, representing a worst-case scenario. We derive the optimal secure degrees of freedom (SDoF) for this model by combining two separate outer bounds. Considering the variations in the number of antennas at each node and the rank of user channels, we categorize our analysis into several regimes. We then present achievable schemes for each regime, grounded in spatial interference alignment, symbol extension and zero-forcing techniques.

IEEE Wireless Communications and Networking Conference•Mar 24, 2025•1 citation
This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.
This paper explores the pair-wise secure degree of freedom (SDoF) of a network with multiple full-duplex multiple-input multiple-output nodes, where the nodes communicate with each other while being wiretapped by a multi-antenna eavesdropper. This paper aims to fill the gap in the theoretical analysis of the optimal pair-wise SDoF of multiple full-duplex node systems from an information theory perspective when the channel state information remains unknown to each node at the beginning of the coherence interval. To this end, we first derive an upper bound of the achievable SDoF of the system using the optimal signal structure of the pair-wise secrecy rate. Then, by demonstrating that the upper bound is achievable using Gaussian signals, the optimal SDoF of the system is derived. The numerical results verify that the obtained optimal pair-wise SDoF extends the existing research with two legitimate nodes and increases the optimal SDoF by adjusting the number of out-of-pair transmit antennas appropriately.
This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.
A wireless network of full-duplex nodes/users, using anti-eavesdropping channel estimation (ANECE) based on collaborative pilots, can yield a positive secure degree-of-freedom (SDoF) regardless of the number of antennas an eavesdropper may have. This paper presents novel results on SDoF of ANECE by analyzing secret-key capacity (SKC) of each pair of nodes in a network of multiple collaborative nodes per channel coherence period. Each transmission session of ANECE has two phases: phase 1 is used for pilots, and phase 2 is used for random symbols. This results in two parts of SDoF of ANECE. Both lower and upper bounds on the SDoF of ANECE for any number of users are shown, and the conditions for the two bounds to meet are given. This leads to important discoveries, including: a) The phase-1 SDoF is the same for both multi-user ANECE and pair-wise ANECE while the former may require only a fraction of the number of time slots needed by the latter; b) For a three-user network, the phase-2 SDoF of all-user ANECE is generally larger than that of pair-wise ANECE; c) For a two-user network, a modified ANECE deploying square-shaped nonsingular pilot matrices yields a higher total SDoF than the original ANECE. The multi-user ANECE and the modified two-user ANECE shown in this paper appear to be the best full-duplex schemes known today in terms of SDoF subject to each node using a given number of antennas for both transmitting and receiving.
We derive an upper bound for the sum secure Degrees of Freedom (sDoF) for the symmetric K-user MIMO Wiretap Multiple Access channel with full channel state information at transmitters (CSIT) but without the knowledge of eavesdroppers channel state information (CSI). We consider the symmetric case with K transmitters each equipped with M antennas, a base station with N antennas and an unknown number of eavesdroppers. Without assuming knowledge of the number (or location) of eavesdroppers, we assume that each eavesdropper has a maximum of Neantennas. The sum sDoF is shown to be upper bounded by Ds= min(max(M, N) - Ne/K, K M - Ne, N). Achievable schemes utilizing cooperative artificial noise transmission and zero-forcing decorrelators are shown to achieve the upper bound for a wide range of values of N/M.
We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.
In this study, we investigate a two-user multiple-input multiple-output (MIMO) multiple access wiretap channel, in which the channel matrices of users exhibit rank deficiency. In this model, the legitimate transmitters and receiver are equipped withMMMandNNNantennas, respectively, while the eavesdropper hasKKKantennas. The channel matrices of legitimate users are rank-deficient, whereas those between transmitters and the eavesdropper are full-rank, representing a worst-case scenario. We derive the optimal secure degrees of freedom (SDoF) for this model by combining two separate outer bounds. Considering the variations in the number of antennas at each node and the rank of user channels, we categorize our analysis into several regimes. We then present achievable schemes for each regime, grounded in spatial interference alignment, symbol extension and zero-forcing techniques.