Search arXivSearch

arXiv · 2609.22936

Wideband Physical Layer Security in Mixed Near-Field and Far-Field Communications

Abstract

Prior studies on wideband physical layer security (PLS) have mostly focused on either far-field or near-field communication systems. In this paper, we investigate PLS in a more general and practical mixed near-field and far-field wideband communication scenario, where a base station (BS) equipped with an extremely large-scale array (XL-array) serves multiple legitimate users in the far field, while a near-field eavesdropper attempts to intercept confidential information at close range. Specifically, we formulate an optimization problem to maximize the secrecy rate of all legitimate users across all subcarriers by jointly designing the transmit beamforming and artificial noise (AN), subject to per-subcarrier power constraints. To gain useful insights into the unique characteristics of mixed-field wideband PLS, we first analyze a special case with a single legitimate user and an eavesdropper. Interestingly, we show that the secure transmission regions in mixed-field wideband systems are not the same across all subcarriers, as revealed by subcarrier-specific secrecy conditions derived from the Fresnel integrals. Moreover, we theoretically demonstrate that introducing frequency-selective AN into the system offers two key benefits: 1) it transforms originally insecure subcarriers into secure ones, and 2) it substantially improves the overall secrecy performance. For the general multiuser setup, we propose an efficient two-stage hybrid beamforming algorithm to jointly design the transmit beamforming and AN, ensuring secure transmission under mixed-field conditions. Building on our analytical insights, we further develop an efficient and low-complexity algorithm that designs the AN beamformers by directly aligning them with the eavesdropper's channel, thereby eliminating the need to optimize AN beamformers across all subcarriers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunpu Zhang, Changsheng You, Hing Cheung So. 2026-09-19. Wideband Physical Layer Security in Mixed Near-Field and Far-Field Communications. https://arxiv.org/abs/2609.22936

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT