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

Lu, Tianyu ORCID: 0000-0002-7958-1594, Chen, Liquan ORCID: 0000-0002-7202-4939, Zhang, Junqing ORCID: 0000-0002-3502-2926, Zhang, Weicheng and Matthaiou, Michail ORCID: 0000-0001-9235-7741 (2025) Polar-Domain Multi-User Key Generation in Near-Field Communications IEEE Transactions on Information Forensics and Security, 20 (99). pp. 11311-11325. ISSN 1556-6013, 1556-6021

Text TIFS2025 Polar-Domain Multi-User Key Generation in Near-Field Communications.pdf - Author Accepted Manuscript Available under License Creative Commons Attribution. Download (936kB) | Preview

Abstract

Given the substantial increase in the number of antennas in extremely large-scale antenna array (ELAA) systems, polar-domain channel modeling 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 implement a zero-forcing (ZF)-based precoding scheme to mitigate the 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 the power allocation variables, and then optimize these variables in the presence of eavesdroppers. Since the ZF method may not fully eliminate interference with imperfect channel state information (CSI), there could be correlation between the measurements of polar-domain channel paths and users. We present a channel decorrelation and reciprocity compensation approach that leverages principal component analysis (PCA) and deep neural networks (DNNs) to mitigate channel correlation issues. Specifically, PCA is first applied at the base station (BS) to decorrelate the composite CSI vector that aggregates the CSI of all users. Following this preprocessing, a DNN is trained to learn the mapping from the decorrelated uplink CSI to the corresponding original downlink CSI. This trained DNN then reconstructs a new version of the downlink CSI, enhancing the cross-correlation between the BS and the users’ CSI, thereby improving uplink/downlink reciprocity. Our simulations evaluate the effectiveness of the DNN-based reciprocity compensation by assessing the normalized mean squared error (NMSE) and the correlation between uplink and downlink CSI, the bit disagreement ratio (BDR) and the randomness of secret keys after quantization.

Item Type:	Article
Uncontrolled Keywords:	4613 Theory Of Computation, 46 Information and Computing Sciences, 4006 Communications Engineering, 40 Engineering
Divisions:	Faculty of Science & Engineering Faculty of Science & Engineering > School of Computer Science & Informatics Faculty of Science & Engineering > School of Computer Science & Informatics > Trustworthy Computing
Depositing User:	Symplectic Admin
Date Deposited:	21 Oct 2025 07:29
Last Modified:	20 Nov 2025 14:40
DOI:	10.1109/tifs.2025.3622317
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3194881
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.