TMVS: Threshold-Based Majority Voting Scheme for Robust SRAM PUFs
- 23 April 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 4846-4861
Abstract
SRAM Physically Unclonable Functions (PUFs) derive secret keys from start-up values for inherent security benefits but suffer from reliability issues due to bit flipping. We introduce the Threshold-based Majority Voting Scheme (TMVS), a lightweight method that eliminates noise and mitigates bias in SRAM PUFs while retaining the simplicity of majority voting decoders used by repetition codes, without the significant entropy loss that repetition codes incur under biased responses. TMVS runs entirely in software, requires no cell-level bit-error rate qualification or SRAM redesign, and avoids the complex decoders of heavy error correcting codes. We derive closed-form expressions for decoding-error probability and expected memory, validate them on experimental data, and present a security analysis that provides exact formulas for min-entropy and secrecy leakage due to helper data and bias, identifying conditions under which TMVS achieves zero secrecy leakage. On a large public dataset, TMVS shows near-zero cross-chip secrecy leakage and preserves average conditional min-entropy above 1 bit despite biased, spatially correlated SRAM statistics. Compared with prior work, TMVS offers the smallest decoding complexity at the cost of a larger PUF size. In a representative configuration, TMVS generates a 128-bit key with failure probability 9.15 · 10−6 and zero secrecy leakage at a bit-flip probability of 10%, requiring only ∼ 248k clock cycles on a 32-bit ARM Cortex-M0. These results show that TMVS is practical and implementation-friendly for resource-constrained, low-power devices.Keywords
Funding Information
- European Union’s Horizon Europe Framework Programme through the OpenSwarm Project (101093046)
This publication has 42 references indexed in Scilit:
- Hiding Secrecy Leakage in Leaky Helper Data2017
- Secure Key Generation from Biased PUFs2015
- A Spatial Majority Voting Technique to Reduce Error Rate of Physically Unclonable FunctionsLecture Notes in Computer Science, 2013
- Physical Unclonable Functions in Theory and Practice2013
- PUFKY: A Fully Functional PUF-Based Cryptographic Key Generator2012
- Soft Decision Error Correction for Compact Memory-Based PUFs Using a Single Enrollment2012
- Side-Channel Analysis of PUFs and Fuzzy Extractors2011
- Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs2009
- Efficient Helper Data Key Extractor on FPGAs2008
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data2004