Backend
Group Physical-Layer Authentication and Confidential Beamforming in Non-Terrestrial Networks
arXiv eess.SP0 views
arXiv:2610.41579v1 Announce Type: new Abstract: Coordinated high-altitude platform station (HAPS) networks need to authenticate group responses and protect private data under shared power constraints. This paper studies joint group physical-layer authentication (PLA) and confidential beamforming using a fresh secret tag superimposed on private data. For received attacks independent of the current tag, we derive exact finite-block expressions for false acceptance and legitimate rejection. These expressions translate authentication error targets into a required tag signal-to-interference-plus-noise ratio (SINR). We establish a nonzero asymptotic tag-energy floor and analyze residual frequency offset and peak-power restrictions. The legitimate receiver removes the tag by orthogonal projection, which discards one temporal dimension. For colluding eavesdroppers, we identify the spatial coverage condition under which artificial noise (AN) keeps their SINR bounded as data and AN powers increase together. We jointly optimize the private beams, tag beam, and AN covariance to minimize transmit power under authentication, secrecy, and per-HAPS power constraints. The method combines semidefinite relaxation (SDR), exact private-beam rank reduction, and feasible successive convex approximation. A corrected dual lower bound measures the remaining optimality gap. Numerical results show that increasing the tag length from 16 to 64 symbols reduces the required tag SINR by 7.16 dB. Joint beam design reduces mean transmit power by 27.4% relative to an optimized fixed-tag-direction baseline. The authentication guarantee requires fresh secret tags and excludes relays of the current response.
Source:https://arxiv.org/abs/2610.41579PreviousGNSS Receiver Operating Point Comparison Between Vector and Scalar Tracking Under High-DynamicsNextLearning Joint Synchronization, Channel Estimation, and Decoding: Comparison with a Finite-Blocklength Achievability Bound
Related posts
Wrap or Rewrite? Reviving the 1989 GlobalMinimum Bayesian Global-Optimization Library for R and Python
0arXiv stat.CO

Snowflake Just Made Business Ontology an AI Priority. Here’s What Comes Next.
0dev.to Data
December 14 Is the Newest Week on the WARN Calendar: 6,274 Workers Scheduled
0dev.to News
Your Chadar trek starts with three days in Leh, not on the ice
0dev.to Productivity
A Starter Scorecard for Leadership Teams of 20 to 50 People: 12 Measures by Function
0dev.to Productivity
How to Find and Reclaim Unused Microsoft 365 Licences
0dev.to Productivity