Secure Authentication in Wireless IoT: Hamming Code Assisted SRAM PUF as Device Fingerprint

• URL: http://arxiv.org/abs/2604.15810v1
• Date: Fri, 17 Apr 2026 08:09:02 GMT
• Title: Secure Authentication in Wireless IoT: Hamming Code Assisted SRAM PUF as Device Fingerprint
• Abstract summary: This work demonstrates a threshold-based authentication proof of concept for constrained Industrial Internet of Things (IIoT) devices.<n>The proposed scheme can reliably cap the post-authentication bit error rate (BER) below 1 %.<n>Inherent PUF unreliability is addressed by a resource-efficient combination of Hamming code (HC) Error Correction (EC) and Temporal Majority Voting (TMV)
• Score: 3.5816744712666075
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Static Random Access Memory (SRAM) Physically Unclonable Functions (PUFs) make use of intrinsic manufacturing variations in memory cells to derive device-unique responses. Employing such hardware-rooted fingerprints for authentication, this work demonstrates a threshold-based authentication proof of concept for constrained Industrial Internet of Things (IIoT) devices. The proposed scheme can reliably cap the the post-authentication bit error rate (BER) below 1 %. Inherent SRAM PUF unreliability is addressed by a resource-efficient combination of Hamming code (HC) Error Correction (EC) and Temporal Majority Voting (TMV). Increasing HC redundancy or TMV count significantly reduces the BER, albeit with diminishing returns and increasingly prohibitive computational overhead. Furthermore, this work quantifies the threshold gap between strict reliability and security constraints. This gap is reframed as a design budget which enables the resource-aware calibration of the acceptance threshold, PUF response length, and stabilization technique, without violating designed-for error limits. Larger responses make reliability optimizations increasingly obsolete. This comparative analysis establishes a comprehensive design space for PUF EC, guiding future implementations in balancing EC quality against resource constraints such as computational demand, power consumption, and implementation complexity.

Related papers

• When Small Variations Become Big Failures: Reliability Challenges in Compute-in-Memory Neural Accelerators [10.520875052654771]
  We show that even small device variations can lead to disproportionately high accuracy degradation and catastrophic failures in safety-critical inference workloads.<n>We introduce SWIM, a selective write-verify mechanism that strategically applies verification only where it is most impactful.<n>Finally, we explore a learning-centric solution that improves realistic worst-case performance by training networks with right-censored noise.
  arXiv  Detail & Related papers  (2026-03-03T20:08:25Z)
• Overcoming Joint Intractability with Lossless Hierarchical Speculative Decoding [58.92526489742584]
  We propose provably lossless.<n> verification method that significantly boosts the expected number of accepted tokens.<n>We show that HSD yields consistent improvements in acceptance rates across diverse model families and benchmarks.
  arXiv  Detail & Related papers  (2026-01-09T11:10:29Z)
• Certifiable Safe RLHF: Fixed-Penalty Constraint Optimization for Safer Language Models [7.422627253922975]
  We introduce Certifiable Safe-RLHF, a cost model trained on a large-scale corpus to assign semantically grounded safety scores.<n>With an appropriately scaled penalty, feasibility of the safety constraints can be guaranteed, eliminating the need for dual-variable updates.<n> Empirical evaluation demonstrates that CS-RLHF outperforms state-of-the-art model responses rendering at-least 5 times efficient against nominal and jail-breaking prompts.
  arXiv  Detail & Related papers  (2025-10-03T21:24:41Z)
• Secure and Scalable Face Retrieval via Cancelable Product Quantization [48.58859061524146]
  homomorphic encryption (HE) offers strong security guarantees by enabling arithmetic computations in the cipher space.<n>We propose Cancelable Product Quantization, a highly efficient framework for secure face representation retrieval.
  arXiv  Detail & Related papers  (2025-08-31T10:19:55Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• The Larger the Merrier? Efficient Large AI Model Inference in Wireless Edge Networks [56.37880529653111]
  The demand for large computation model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications.<n>In this paper, we investigate the LAIM-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment.
  arXiv  Detail & Related papers  (2025-05-14T08:18:55Z)
• PLS-Assisted Offloading for Edge Computing-Enabled Post-Quantum Security in Resource-Constrained Devices [13.649969611527746]
  Post-quantum cryptography (PQC) standards have become imperative for resource-constrained devices (RCDs) in the Internet of Things (IoT)<n>We propose an edge computing-enabled PQC framework that leverages a physical-layer security (PLS)-assisted offloading strategy.<n>Our framework integrates two PLS techniques: offloading RCDs employ wiretap coding to secure data transmission, while non-offloading RCDs serve as friendly jammers by broadcasting artificial noise.
  arXiv  Detail & Related papers  (2025-04-13T05:14:17Z)
• Continuous-Variable Quantum Key Distribution with Composable Security and Tight Error Correction Bound for Constrained Devices [1.726266255043611]
  Constrained devices, such as smart sensors, wearable devices, and Internet of Things nodes, rely on secure communications to function properly.<n>CV-QKD offers the highest secure key rate and the greatest versatility for integration into existing infrastructure.
  arXiv  Detail & Related papers  (2025-04-08T19:08:08Z)
• Towards Resource-Efficient Federated Learning in Industrial IoT for Multivariate Time Series Analysis [50.18156030818883]
  Anomaly and missing data constitute a thorny problem in industrial applications. Deep learning enabled anomaly detection has emerged as a critical direction. The data collected in edge devices contain user privacy.
  arXiv  Detail & Related papers  (2024-11-06T15:38:31Z)
• Digital Twin-Assisted Federated Learning with Blockchain in Multi-tier Computing Systems [67.14406100332671]
  In Industry 4.0 systems, resource-constrained edge devices engage in frequent data interactions. This paper proposes a digital twin (DT) and federated digital twin (FL) scheme. The efficacy of our proposed cooperative interference-based FL process has been verified through numerical analysis.
  arXiv  Detail & Related papers  (2024-11-04T17:48:02Z)
• Enhancing Dropout-based Bayesian Neural Networks with Multi-Exit on FPGA [20.629635991749808]
  This paper proposes an algorithm and hardware co-design framework that can generate field-programmable gate array (FPGA)-based accelerators for efficient BayesNNs. At the algorithm level, we propose novel multi-exit dropout-based BayesNNs with reduced computational and memory overheads. At the hardware level, this paper introduces a transformation framework that can generate FPGA-based accelerators for the proposed efficient BayesNNs.
  arXiv  Detail & Related papers  (2024-06-20T17:08:42Z)
• Security of high-speed quantum key distribution with imperfect sources [1.2815904071470707]
  Imperfect encoders compromise the security of quantum key distribution (QKD) systems via modulation flaws, side channels and inter-pulse correlations.<n>Here, we present a finite-key security proof approach against coherent attacks that incorporates general encoding imperfections while achieving significantly better performances and requiring only partial characterization.
  arXiv  Detail & Related papers  (2023-05-10T07:02:32Z)
• RRNet: Towards ReLU-Reduced Neural Network for Two-party Computation Based Private Inference [17.299835585861747]
  We introduce RRNet, a framework that aims to jointly reduce the overhead of MPC comparison protocols and accelerate computation through hardware acceleration. Our approach integrates the hardware latency of cryptographic building blocks into the DNN loss function, resulting in improved energy efficiency, accuracy, and security guarantees.
  arXiv  Detail & Related papers  (2023-02-05T04:02:13Z)

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.