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 Information Forensics and Security

Multi-User Key Rate Optimization for Near-Field Extremely Large-Scale Antenna Array Communications

Tianyu Lu, Liquan Chen, Junqing Zhang, Trung Q. Duong

Published Jan 1, 2025• 0 citations
Publisher

Abstract

Extremely large-scale antenna arrays (ELAA) require near-field spherical wave modeling due to the substantial increase in the number of antennas, which introduces new spatial dimensions to physical layer key generation (PLKG). We investigate multi-user PLKG in near-field environments, where a base station with an ELAA simultaneously generates secret keys with multiple users. We derive an analytical expression for the key rate (KR). By utilizing spatial dimensions of distance and angle in near-field environments, we apply eigenvalue decomposition and singular value decomposition to design precoding matrices to reduce interference among user equipments (UEs) and extract uncorrelated subchannels. Given that the KR is non-convex, we approximate it and optimize the precoding matrix to increase the KR. After precoding design, the KR depends on the transmit power allocated to the subchannels. Two optimization problems are formulated to further optimize transmit power allocation. The first problem focuses on maximizing the sum KR. We apply the Lagrange multiplier method to determine the optimal power allocation variables by searching the Lagrange multiplier. To reduce computational complexity, a supervised feedforward neural network (FNN) is designed to capture the relationship between the power allocation variables and the Lagrange multiplier. The second optimization problem focuses on KR fairness. By introducing a slack variable that is smaller than the KRs of all users, we use the CVX toolbox to find optimal power allocation variables that maximize this slack variable. To further reduce complexity, the Lagrange multiplier method offers an analytical solution for power allocation variables in terms of Lagrange multipliers determined by the slack variable in the high-power case. We employ a bisection algorithm to find the slack variable. Furthermore, we propose an FNN to map transmit power to the slack variable. Simulations demonstrate that the proposed methods efficiently leverage near-field effects for multi-user PLKG, reducing pilot overhead.

DOI
10.1109/tifs.2025.3594198

Related papers

Polar-Domain Multi-User Key Generation in Near-Field Communications

Tianyu Lu, Liquan Chen, Junqing Zhang +2 more

With the substantial increase in the number of antennas, polar-domain channel modeling for extremely large-scale antenna array (ELAA) systems has been introduced to capture both angular and distance information in near-field environments. The fine-grained polar-domain channel provides additional sources of randomness, making it well-suited for physical layer key generation (PLKG). To minimize the pilot overhead in multi-user key generation and leverage the randomness from the polar-domain channel paths, we herein design a zero-forcing (ZF)-based precoding scheme to mitigate inter-path and inter-user interference. Using ZF precoding, we derive an analytical expression for the sum secret key rate (SKR) as a function of power allocation variables, and then optimize these variables in the presence of eavesdroppers. Our simulations validate the proposed precoding design and power allocation methods in terms of sum SKR versus the transmit power, antenna configurations, and spatial correlation between legitimate and eavesdropping channels.

Globecom•Dec 8, 2025•0 citations

Power Allocation and Beam Scheduling for Multi-User Massive MIMO Secret Key Generation

Chen K. Sun, Guyue Li

Secret key generation in multi-user massive multiple-input multiple-output (MIMO) communication suffers from high computation complexity, pilot overhead, and inter-user interference caused by the large dimension of the massive MIMO channel. To address these problems, this paper proposes a novel key generation approach that exploits the beam domain channel for channel feature extraction. The proposed approach can effectively reduce the channel feature dimension and mitigate the inter-user interference, via the well-designed power allocation and beam scheduling algorithms. Specifically, the multi-user key generation model is built and the design problem of channel feature extraction matrices is formulated as a sum key rate maximization problem. To tackle this problem, we derive an upper bound of the secret key rate and prove that the upper bound maximization is a convex optimization. After solving the upper bound maximization, the base station (BS) obtains the sum beams for all the users. To allocate the selected beams to each user, an efficient beam scheduling algorithm is proposed, which converges to a locally optimal solution with low computational complexity. Numerical results illustrate that in the proposed scheme, the bit disagreement ratio (BDR) of legitimate users achieves 10−2, while that of the eavesdropper tends to 0.5, confirming the feasibility and security of the proposed scheme.

IEEE Access•Jan 1, 2020•10 citations

Sum Secret Key Rate Maximization for TDD Multi-User Massive MIMO Wireless Networks

Guyue Li, Chen K. Sun, Eduard Axel Jorswieck +3 more

Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas. However, the fifth generation (5G) wireless communications employ massive multiple-input multiple-output (MIMO) to support multiple users simultaneously, bringing serious overhead of reciprocal channel acquisition. This paper presents a multi-user secret key generation in massive MIMO wireless networks. We provide a beam domain channel model, in which different elements represent the channel gains from different transmit directions to different receive directions. Based on this channel model, we analyze the secret key rate and derive a closed-form expression under independent channel conditions. To maximize the sum secret key rate, we provide the optimal conditions for the Kronecker product of the precoding and receiving matrices and propose an algorithm to generate these matrices with pilot reuse. The proposed optimization design can significantly reduce the pilot overhead of the reciprocal channel state information acquisition. Furthermore, we analyze the security under the channel correlation between user terminals (UTs), and propose a low overhead multi-user secret key generation with non-overlapping beams between UTs. Simulation results demonstrate the near-optimal performance of the proposed precoding and receiving matrices design and the advantages of the non-overlapping beam allocation.

arXiv:2009.09142•IEEE Transactions on Information Forensics and Security•Sep 24, 2020•53 citations

Precoding Design for Key Generation in Near-Field Extremely Large-Scale MIMO Communications

Tianyu Lu, Liquan Chen, Junqing Zhang +3 more

This paper investigates an artificial randomness-based key generation scheme in near-field extremely large-scale multiple-input multiple-output (XL-MIMO) communications, aiming to overcome the limitations of static wireless chan-nels in generating secret keys. The proposed approach introduces artificial randomness via the pre coding vector, enabling legitimate users to generate secret keys while preventing eavesdropping. To maximize the secret key rate (SKR), the singular value decomposition (SVD) method is utilized to identify the legitimate subspace for generating secret keys and its orthogonal subspace to thwart eavesdropping. Additionally, a Dinkelbach method-based power allocation algorithm is designed to inject noise into both the legitimate subspace and its orthogonal subspace. Our simulation results validate the efficiency of the proposed key generation scheme, demonstrating its superiority over existing approaches.

IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2023•0 citations

Physical-Layer Security in Mixed Near-Field and Far-Field Communication Systems

Tianyu Liu, Changsheng You, Cong Zhou +4 more

Extremely large-scale arrays(XL-arrays) have emerged as a promising technology to improve the spectrum efficiency and spatial resolution of future wireless systems. Different from existing works that mostly considered physical layer security (PLS) in either the far-field or near-field, we consider in this paper a new and practical scenario, where legitimate users (Bobs) are located in the far-field of a base station (BS) while eavesdroppers (Eves) are located in the near-field for intercepting confidential information at short distance, referred to as themixed near-field and far-field PLS. Specifically, we formulate an optimization problem to maximize the sum-secrecy-rate of all Bobs by optimizing the power allocation of the BS, subject to the constraint on the total BS transmit power. To shed useful insights, we first consider a one-Bob-one-Eve system and characterize the insecure-transmission region of the Bob in closed form. Interestingly, we show that the insecure-transmission region is significantlyexpandedas compared to that in conventional far-field PLS systems, due to theenergy-spread effectin the mixed-field scenario. Then, we further extend the analysis to a two-Bob-one-Eve system. It is revealed that as compared to the one-Bob system, the interferences from the other Bob can be effectively used to weaken the capability of Eve for intercepting signals of target Bobs, thus leading to enhanced secrecy rates. Furthermore, we propose an efficient algorithm to obtain a high-quality solution to the formulated non-convex problem by leveraging the successive convex approximation (SCA) technique. Finally, numerical results demonstrate that our proposed algorithm achieves a higher sum-secrecy-rate than the benchmark scheme where the power allocation is designed based on the (simplified) far-field channel model.

arXiv:2504.19555•IEEE Transactions on Cognitive Communications and Networking•Oct 1, 2025•14 citations

Fluid Antenna System-Assisted Physical Layer Secret Key Generation

Zhiyu Huang, Guyue Li, Hao Xu +1 more

This paper investigates physical-layer key generation (PLKG) in multi-antenna base station systems, by leveraging a fluid antenna system (FAS) to dynamically customize radio environments. Without requiring additional nodes or extensive radio frequency (RF) chains, the FAS effectively enables adaptive antenna port selection by exploiting channel spatial correlation to enhance the secret key rate (SKR) at legitimate nodes. To comprehensively evaluate the performance of the FAS in PLKG, we propose an FAS-assisted PLKG model that integrates transmit beamforming and sparse port selection under independent and identically distributed (i.i.d.) and spatially correlated channel models, respectively. Specifically, the PLKG utilizes reciprocal channel probing to derive an approximate SKR expression based on the mutual information between legitimate channel estimates, explicitly accounting for the Eve’s channel observation under spatially correlated channel scenarios. Nonconvex optimization problems for these scenarios are formulated to maximize the SKR subject to transmit power constraints and sparse port activation. We propose an iterative algorithm by capitalizing on successive convex approximation and Cauchy-Schwarz inequality to obtain a locally optimal solution. A reweighted ℓ1-norm-based algorithm is applied to advocate for the sparse port activation of FAS-assisted PLKG. To approximate the optimal activated ports obtained by exhaustive search, a low-complexity sliding window-based port selection is proposed to substitute reweighted ℓ1-norm method based on Rayleigh-quotient analysis. Simulation results demonstrate that the FAS-assisted PLKG scheme significantly outperforms fixed antenna-assisted PLKG schemes in both environments. It is shown that the FAS achieves higher SKR with fewer RF chains through dynamic sparse port selection, which effectively reduces the resource overhead. Also, the sliding window approach closely approximates the globally optimal port selection compared to the reweighted ℓ1-norm method, rendering it suitable for practical deployments.

arXiv:2509.15547•IEEE Journal on Selected Areas in Communications•Jan 1, 2026•3 citations
Extremely large-scale antenna arrays (ELAA) require near-field spherical wave modeling due to the substantial increase in the number of antennas, which introduces new spatial dimensions to physical layer key generation (PLKG). We investigate multi-user PLKG in near-field environments, where a base station with an ELAA simultaneously generates secret keys with multiple users. We derive an analytical expression for the key rate (KR). By utilizing spatial dimensions of distance and angle in near-field environments, we apply eigenvalue decomposition and singular value decomposition to design precoding matrices to reduce interference among user equipments (UEs) and extract uncorrelated subchannels. Given that the KR is non-convex, we approximate it and optimize the precoding matrix to increase the KR. After precoding design, the KR depends on the transmit power allocated to the subchannels. Two optimization problems are formulated to further optimize transmit power allocation. The first problem focuses on maximizing the sum KR. We apply the Lagrange multiplier method to determine the optimal power allocation variables by searching the Lagrange multiplier. To reduce computational complexity, a supervised feedforward neural network (FNN) is designed to capture the relationship between the power allocation variables and the Lagrange multiplier. The second optimization problem focuses on KR fairness. By introducing a slack variable that is smaller than the KRs of all users, we use the CVX toolbox to find optimal power allocation variables that maximize this slack variable. To further reduce complexity, the Lagrange multiplier method offers an analytical solution for power allocation variables in terms of Lagrange multipliers determined by the slack variable in the high-power case. We employ a bisection algorithm to find the slack variable. Furthermore, we propose an FNN to map transmit power to the slack variable. Simulations demonstrate that the proposed methods efficiently leverage near-field effects for multi-user PLKG, reducing pilot overhead.
With the substantial increase in the number of antennas, polar-domain channel modeling for extremely large-scale antenna array (ELAA) systems has been introduced to capture both angular and distance information in near-field environments. The fine-grained polar-domain channel provides additional sources of randomness, making it well-suited for physical layer key generation (PLKG). To minimize the pilot overhead in multi-user key generation and leverage the randomness from the polar-domain channel paths, we herein design a zero-forcing (ZF)-based precoding scheme to mitigate inter-path and inter-user interference. Using ZF precoding, we derive an analytical expression for the sum secret key rate (SKR) as a function of power allocation variables, and then optimize these variables in the presence of eavesdroppers. Our simulations validate the proposed precoding design and power allocation methods in terms of sum SKR versus the transmit power, antenna configurations, and spatial correlation between legitimate and eavesdropping channels.
Secret key generation in multi-user massive multiple-input multiple-output (MIMO) communication suffers from high computation complexity, pilot overhead, and inter-user interference caused by the large dimension of the massive MIMO channel. To address these problems, this paper proposes a novel key generation approach that exploits the beam domain channel for channel feature extraction. The proposed approach can effectively reduce the channel feature dimension and mitigate the inter-user interference, via the well-designed power allocation and beam scheduling algorithms. Specifically, the multi-user key generation model is built and the design problem of channel feature extraction matrices is formulated as a sum key rate maximization problem. To tackle this problem, we derive an upper bound of the secret key rate and prove that the upper bound maximization is a convex optimization. After solving the upper bound maximization, the base station (BS) obtains the sum beams for all the users. To allocate the selected beams to each user, an efficient beam scheduling algorithm is proposed, which converges to a locally optimal solution with low computational complexity. Numerical results illustrate that in the proposed scheme, the bit disagreement ratio (BDR) of legitimate users achieves 10−2, while that of the eavesdropper tends to 0.5, confirming the feasibility and security of the proposed scheme.
Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas. However, the fifth generation (5G) wireless communications employ massive multiple-input multiple-output (MIMO) to support multiple users simultaneously, bringing serious overhead of reciprocal channel acquisition. This paper presents a multi-user secret key generation in massive MIMO wireless networks. We provide a beam domain channel model, in which different elements represent the channel gains from different transmit directions to different receive directions. Based on this channel model, we analyze the secret key rate and derive a closed-form expression under independent channel conditions. To maximize the sum secret key rate, we provide the optimal conditions for the Kronecker product of the precoding and receiving matrices and propose an algorithm to generate these matrices with pilot reuse. The proposed optimization design can significantly reduce the pilot overhead of the reciprocal channel state information acquisition. Furthermore, we analyze the security under the channel correlation between user terminals (UTs), and propose a low overhead multi-user secret key generation with non-overlapping beams between UTs. Simulation results demonstrate the near-optimal performance of the proposed precoding and receiving matrices design and the advantages of the non-overlapping beam allocation.
This paper investigates an artificial randomness-based key generation scheme in near-field extremely large-scale multiple-input multiple-output (XL-MIMO) communications, aiming to overcome the limitations of static wireless chan-nels in generating secret keys. The proposed approach introduces artificial randomness via the pre coding vector, enabling legitimate users to generate secret keys while preventing eavesdropping. To maximize the secret key rate (SKR), the singular value decomposition (SVD) method is utilized to identify the legitimate subspace for generating secret keys and its orthogonal subspace to thwart eavesdropping. Additionally, a Dinkelbach method-based power allocation algorithm is designed to inject noise into both the legitimate subspace and its orthogonal subspace. Our simulation results validate the efficiency of the proposed key generation scheme, demonstrating its superiority over existing approaches.
Extremely large-scale arrays(XL-arrays) have emerged as a promising technology to improve the spectrum efficiency and spatial resolution of future wireless systems. Different from existing works that mostly considered physical layer security (PLS) in either the far-field or near-field, we consider in this paper a new and practical scenario, where legitimate users (Bobs) are located in the far-field of a base station (BS) while eavesdroppers (Eves) are located in the near-field for intercepting confidential information at short distance, referred to as themixed near-field and far-field PLS. Specifically, we formulate an optimization problem to maximize the sum-secrecy-rate of all Bobs by optimizing the power allocation of the BS, subject to the constraint on the total BS transmit power. To shed useful insights, we first consider a one-Bob-one-Eve system and characterize the insecure-transmission region of the Bob in closed form. Interestingly, we show that the insecure-transmission region is significantlyexpandedas compared to that in conventional far-field PLS systems, due to theenergy-spread effectin the mixed-field scenario. Then, we further extend the analysis to a two-Bob-one-Eve system. It is revealed that as compared to the one-Bob system, the interferences from the other Bob can be effectively used to weaken the capability of Eve for intercepting signals of target Bobs, thus leading to enhanced secrecy rates. Furthermore, we propose an efficient algorithm to obtain a high-quality solution to the formulated non-convex problem by leveraging the successive convex approximation (SCA) technique. Finally, numerical results demonstrate that our proposed algorithm achieves a higher sum-secrecy-rate than the benchmark scheme where the power allocation is designed based on the (simplified) far-field channel model.
This paper investigates physical-layer key generation (PLKG) in multi-antenna base station systems, by leveraging a fluid antenna system (FAS) to dynamically customize radio environments. Without requiring additional nodes or extensive radio frequency (RF) chains, the FAS effectively enables adaptive antenna port selection by exploiting channel spatial correlation to enhance the secret key rate (SKR) at legitimate nodes. To comprehensively evaluate the performance of the FAS in PLKG, we propose an FAS-assisted PLKG model that integrates transmit beamforming and sparse port selection under independent and identically distributed (i.i.d.) and spatially correlated channel models, respectively. Specifically, the PLKG utilizes reciprocal channel probing to derive an approximate SKR expression based on the mutual information between legitimate channel estimates, explicitly accounting for the Eve’s channel observation under spatially correlated channel scenarios. Nonconvex optimization problems for these scenarios are formulated to maximize the SKR subject to transmit power constraints and sparse port activation. We propose an iterative algorithm by capitalizing on successive convex approximation and Cauchy-Schwarz inequality to obtain a locally optimal solution. A reweighted ℓ1-norm-based algorithm is applied to advocate for the sparse port activation of FAS-assisted PLKG. To approximate the optimal activated ports obtained by exhaustive search, a low-complexity sliding window-based port selection is proposed to substitute reweighted ℓ1-norm method based on Rayleigh-quotient analysis. Simulation results demonstrate that the FAS-assisted PLKG scheme significantly outperforms fixed antenna-assisted PLKG schemes in both environments. It is shown that the FAS achieves higher SKR with fewer RF chains through dynamic sparse port selection, which effectively reduces the resource overhead. Also, the sliding window approach closely approximates the globally optimal port selection compared to the reweighted ℓ1-norm method, rendering it suitable for practical deployments.