Enhanced Multiuser CSI-Based Physical Layer Authentication Based on Information Reconciliation

• URL: http://arxiv.org/abs/2505.10932v1
• Date: Fri, 16 May 2025 07:11:04 GMT
• Title: Enhanced Multiuser CSI-Based Physical Layer Authentication Based on Information Reconciliation
• Authors: Atsu Kokuvi Angélo Passah, Arsenia Chorti, Rodrigo C. de Lamare,
• Abstract summary: Physical layer authentication (PLA) is a cost-effective solution for low-end Internet of Things networks.<n>We develop an information reconciliation scheme using Polar codes along with a quantization strategy that employs an arbitrary number of bits to enhance the performance of PLA.
• Score: 20.54391139132056
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a physical layer authentication (PLA) technique using information reconciliation in multiuser communication systems. A cost-effective solution for low-end Internet of Things networks can be provided by PLA. In this work, we develop an information reconciliation scheme using Polar codes along with a quantization strategy that employs an arbitrary number of bits to enhance the performance of PLA. We employ the principle of Slepian-Wolf coding to reconcile channel measurements spread in time. Numerical results show that our approach works very well and outperforms competing approaches, achieving more than 99.80% increase in detection probability for false alarm probabilities close to 0.

Related papers

• Power Allocation for Delay Optimization in Device-to-Device Networks: A Graph Reinforcement Learning Approach [32.49886544394408]
  This paper explores a novel power power approach for delay optimization, utilizing neural networks (GNNs)-based reinforcement learning (RL) in device-to-device (D2D) communication.<n>The proposed method effectively reduces average delay while ensuring user fairness, outperforms baseline methods, and exhibits and generalization capability.
  arXiv  Detail & Related papers  (2025-05-19T09:37:00Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• Physical Layer Authentication Using Information Reconciliation [20.54391139132056]
  This paper proposes physical layer authentication (PLA) expected to complement existing traditional approaches. The precision and consistency of PLA is impacted because of random variations of wireless channel realizations between different time slots. In particular, we adopt distributed source coding (Slepian-Wolf) reconciliation using polar codes to reconcile channel measurements spread in time.
  arXiv  Detail & Related papers  (2024-04-19T13:20:13Z)
• The Wyner Variational Autoencoder for Unsupervised Multi-Layer Wireless Fingerprinting [6.632671046812309]
  We propose a multi-layer fingerprinting framework that jointly considers the multi-layer signatures for improved identification performance. In contrast to previous works, by leveraging the recent multi-view machine learning paradigm, our method can cluster the device information shared among the multi-layer features without supervision. Our empirical results show that the proposed method outperforms the state-of-the-art baselines in both supervised and unsupervised settings.
  arXiv  Detail & Related papers  (2023-03-28T10:05:06Z)
• MARLIN: Soft Actor-Critic based Reinforcement Learning for Congestion Control in Real Networks [63.24965775030673]
  We propose a novel Reinforcement Learning (RL) approach to design generic Congestion Control (CC) algorithms. Our solution, MARLIN, uses the Soft Actor-Critic algorithm to maximize both entropy and return. We trained MARLIN on a real network with varying background traffic patterns to overcome the sim-to-real mismatch.
  arXiv  Detail & Related papers  (2023-02-02T18:27:20Z)
• Personalized Decentralized Multi-Task Learning Over Dynamic Communication Graphs [59.96266198512243]
  We propose a decentralized and federated learning algorithm for tasks that are positively and negatively correlated. Our algorithm uses gradients to calculate the correlations among tasks automatically, and dynamically adjusts the communication graph to connect mutually beneficial tasks and isolate those that may negatively impact each other. We conduct experiments on a synthetic Gaussian dataset and a large-scale celebrity attributes (CelebA) dataset.
  arXiv  Detail & Related papers  (2022-12-21T18:58:24Z)
• Learning Robust Beamforming for MISO Downlink Systems [14.429561340880074]
  A base station identifies efficient multi-antenna transmission strategies only with imperfect channel state information (CSI) and its features. We propose a robust training algorithm where a deep neural network (DNN) is optimized to fit to real-world propagation environment.
  arXiv  Detail & Related papers  (2021-03-02T09:56:35Z)
• CosSGD: Nonlinear Quantization for Communication-efficient Federated Learning [62.65937719264881]
  Federated learning facilitates learning across clients without transferring local data on these clients to a central server. We propose a nonlinear quantization for compressed gradient descent, which can be easily utilized in federated learning. Our system significantly reduces the communication cost by up to three orders of magnitude, while maintaining convergence and accuracy of the training process.
  arXiv  Detail & Related papers  (2020-12-15T12:20:28Z)
• Privacy Amplification by Decentralization [0.0]
  We introduce a novel relaxation of local differential privacy (LDP) that naturally arises in fully decentralized protocols. We study a decentralized model of computation where a token performs a walk on the network graph and is updated sequentially by the party who receives it. We prove that the privacy-utility trade-offs of our algorithms significantly improve upon LDP, and in some cases even match what can be achieved with methods based on trusted/secure aggregation and shuffling.
  arXiv  Detail & Related papers  (2020-12-09T21:33:33Z)
• Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming [97.40955121478716]
  We propose a first-order dual SDP algorithm that requires memory only linear in the total number of network activations. We significantly improve L-inf verified robust accuracy from 1% to 88% and 6% to 40% respectively. We also demonstrate tight verification of a quadratic stability specification for the decoder of a variational autoencoder.
  arXiv  Detail & Related papers  (2020-10-22T12:32:29Z)
• ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
  We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
  arXiv  Detail & Related papers  (2020-06-28T23:09:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.