Cross-Layer Roots of Trust: Integrating Biometrics, PUFs, and Hardware Obfuscation

I. INTRODUCTION

• Biometrics, PUFs, and logic locking establish trust respectively in the human, physical device, and authorized hardware function.The architecture treats these as complementary roots rather than a single credential.Source: §I · p. 1, §II · p. 2
• Security does not compose automatically: legitimate users may access counterfeit devices, genuine devices may serve unauthorized users, and exposed keys may bypass locked circuits.Connected interfaces become part of the attack surface.Source: §I · p. 1
• The survey models authorization as A = T_H ∧ T_D ∧ T_F, without assuming statistical independence among human, device, and function trust.Failures can propagate through key derivation, device binding, and hardware activation.Source: §I · p. 1
• Each primitive is examined through its complete processing pipeline, implementation assumptions, security properties, failure modes, evaluation metrics, and pairwise or three-way compositions.The framework targets systems where an authorized user interacts with an authentic device to activate a protected function.Source: §I · pp. 1–2
• Biometric authorization spans sensing, quality control and PAD, preprocessing, feature extraction, protection, matching or recovery, and final decision.Every stage introduces distinct security exposure, cost, power, latency, and scalability constraints.Source: A. Complete Biometric Processing Chain · p. 2, 1) Sensing · p. 2, 2) Quality Control and… · p. 2
• Biometric key generation requires exact binary-key recovery, making intra-user variability and reliability protection more consequential than in similarity-based verification.Its costs can include quantization, reliability estimation, secure-sketch or fuzzy-extractor operations, decoding, hashing, and protected storage.Source: 5) Template Protection and Biometric… · p. 4

Verification

• Conventional verification accepts a probe when its similarity score crosses threshold τ, trading false acceptance against false rejection.FAR measures impostor acceptance, while FRR measures legitimate-user rejection.Source: 6) Matching or Key Recovery · p. 4, 1) Decision Metrics · p. 5

Key Recovery

• Biometric key-generation systems instead reconstruct the enrollment key from a noisy binary sequence using helper data and a recovery operation.The recovered key can be verified by comparing its protected representation with the enrolled value.Source: 6) Matching or Key Recovery · p. 4, 7) Decision and Authorization · p. 5

Cost

• Matching scales with database size, while key recovery avoids template search but adds error correction, helper-data processing, hashing, or cryptographic verification.Direct comparison of N m-dimensional templates requires approximately Cmatch = O(Nm).Source: 6) Matching or Key Recovery · p. 4

Authorization

• Authorization is the final security-critical stage: decision overrides, threshold manipulation, privilege escalation, or leakage can nullify preceding protections.In the integrated architecture, biometric errors or leakage can propagate into PUF challenge generation and hardware authorization.Source: 7) Decision and Authorization · p. 5, 8) End-to-End Security and Cost… · p. 5

Key Recovery

• Key-generation evaluation must jointly report reliability, entropy, key length, inter-user separation, helper-data overhead, and implementation costs.These metrics capture reproducibility, unpredictability, separation, and resource demands across the recovery pipeline.Source: B. Biometric Decision and Key Metrics · p. 5, 2) Biometric Key-Generation Metrics · pp. 5–6

Verification

• Threshold selection creates a security–usability trade-off: increasing τ generally lowers FAR but raises FRR.Deployment studies should report FAR and FRR at application-specific thresholds, especially when hardware activation requires very low FAR.Source: 1) Decision Metrics · p. 5

Overview

• Biometric key generation must repeatedly map same-user measurements to identical binary material or use error correction to reconstruct the enrollment key.This exact-recovery requirement is stricter than threshold-based biometric verification.Source: §IV · p. 6
• Quantization applies feature extraction followed by a mapping from continuous feature values to binary symbols.The pipeline represents features as z_u = f(x_u) and keys as K_u = Q(z_u).Source: §IV · p. 6

Fixed and Adaptive Quantization

• Fixed quantization uses globally shared intervals, whereas adaptive quantization uses enrollment statistics, guard bands, or feature selection to exclude unstable regions.Fixed boundaries require little user-specific metadata; adaptive boundaries or selection criteria are user-dependent.Source: §IV · p. 6, A. Protocol I: Fixed Quantization · p. 6

Fixed Quantization

• A q-bit fixed quantizer partitions each feature range into M = 2^q intervals and maps the containing region to a q-bit word.For feature j, region r is selected when β_j,r ≤ z_u,j < β_j,r+1.Source: A. Protocol I: Fixed Quantization · p. 6

Enrollment and Protection

• Fixed-quantization enrollment applies the same boundaries to representative enrollment features, concatenating symbols into a constant-length key L_K = mq.Protected verification values and optional helper data can replace direct storage of the raw key.Source: 1) Enrollment · p. 7

Authentication

• During authentication, the same feature extraction and global quantization pipeline reconstructs a key, with helper data supporting recovery when residual errors remain.No guard-band test is normally applied, reducing runtime complexity but increasing sensitivity to intra-user variation.Source: 2) Authentication and Key Reconstruction · p. 7

Reliability

• Fixed-boundary reliability varies with a user’s mean location: features near interval centers are more stable than features near boundaries.Users with the same feature variance can therefore experience different reconstruction reliability.Source: 3) Reliability Under Fixed Quantization · pp. 7–8
• A small per-bit error probability can make exact reconstruction of a long key unlikely, approximately KR ≈ (1 − p_b)^L_K.The approximation assumes independent bit errors without error correction.Source: 3) Reliability Under Fixed Quantization · p. 8

Entropy and Separation

• Uniform intervals do not guarantee uniform symbols; nonuniform biometric distributions can reduce effective key entropy despite nominally contributing q bits per feature.Inter-user Hamming distance should be interpreted jointly with entropy because distance near 0.5 does not prove independence or prediction resistance.Source: 4) Entropy and Inter-User Separation · p. 8

Implementation

• Fixed quantization costs approximately O(mM) comparisons with linear search or O(m log M) with binary lookup, and its boundary storage is independent of enrolled-user count.User-specific storage can be limited to protected verification data and optional helper data.Source: 5) Computation and Storage Cost · p. 8

Advantages

• Fixed quantization provides deterministic mapping, constant key length, small user-specific storage, and straightforward hardware realization.The same quantizer can be implemented for every user.Source: 6) Advantages and Limitations · p. 8

Limitations

• Fixed quantization lacks user-specific reliability adaptation, so small biometric variations can cause bit transitions even when conventional matching still identifies the same user.Robustness is consequently shifted toward preprocessing, fuzzy extraction, and error correction.Source: 6) Advantages and Limitations · p. 8

Adaptive Quantization

• Adaptive quantization retains features only when reliability and population-level entropy exceed thresholds, expressing a reliability–entropy trade-off.Highly stable but nondiscriminative features and distinctive but unstable features are both excluded.Source: B. Protocol II: Adaptive Quantization · pp. 8–9
• Guard bands reject measurements near quantization boundaries instead of forcing them into neighboring codes.A feature contributes a bit only when its minimum boundary margin meets the required safety margin.Source: 1) Adaptive Guard Bands · p. 9

Adaptive Guard Bands

• Adaptive quantization estimates each user’s feature behavior during enrollment and retains features meeting stability and discriminability requirements.The resulting map is user dependent rather than governed by shared global boundaries.Source: 2) Enrollment · p. 9
• Enrollment collects repeated measurements to estimate feature means and variances, with larger variance indicating greater risk of boundary crossing.These statistics support user-specific reliability margins and interval selection.Source: 2) Enrollment · p. 9
• Guard bands exclude measurements near decision boundaries instead of forcing uncertain observations into neighboring binary states.This treats boundary-adjacent observations as erasures during authentication.Source: 2) Enrollment · p. 9, 3) Authentication and Key Reconstruction · p. 10
• Feature selection balances reliability against population entropy, rejecting unstable high-entropy features and predictable low-entropy features.Retained features are partitioned into selected intervals mapped to binary codewords.Source: 2) Enrollment · pp. 9–10
• The raw key concatenates codewords from retained features, while its length may vary by user according to the number of reliable quantization states.Enrollment also produces quantization parameters, helper information, and a protected verification representation rather than storing the raw key.Source: 2) Enrollment · p. 10
• Authentication reprocesses selected features with stored parameters, reconstructs a noisy sequence, applies error correction when needed, and verifies the protected representation.Only enrollment-selected features are evaluated, using the stored user-specific quantization parameters.Source: 3) Authentication and Key Reconstruction · p. 10

C. Fixed Versus Adaptive Quantization: RQ-Driven Analysis

• Fixed quantization assigns every observation to predefined intervals, so small boundary perturbations can change the generated bit.Adaptive quantization instead discards boundary-adjacent measurements through guard bands.Source: 1) RQ1: Which Method Produces More… · p. 11
• Adaptive quantization should be judged by whether reduced intra-user BER justifies the loss of usable features and key length.The principal reliability metric is RelK = 1 − BERintra, paired with reporting of retained length.Source: 1) RQ1: Which Method Produces More… · p. 11, 2) RQ2: What Is the… · p. 11
• Noise-aware ECG results reported high reliability under severe synthesized noise for NA-IOMBA, while conventional IOMBA degraded more strongly.This comparison is presented as evidence for evaluating robustness under controlled noise conditions.Source: 4) RQ4: Which Method Is More Robust to… · p. 11
• Adaptive quantization adds enrollment costs for statistics, selection, interval optimization, and optional error-correction design.Online processing can nevertheless be lower because only the selected features are processed.Source: 5) RQ5: What Is the Computational Cost? · p. 11
• Strategy choice depends on application priorities spanning implementation simplicity, enrollment cost, runtime processing, reliability, environmental noise, and error-correction burden.For hardware-rooted systems, unreliable biometric bits can propagate into PUF challenges, cryptographic keys, or obfuscation keys.Source: 5) RQ5: What Is the Computational Cost? · p. 11, 6) RQ6: Which Method Provides the… · pp. 11–12

D. Biometric Challenges and Limitations

• Biometric hardware unlocking amplifies risks from intra-user variation, poor revocability, presentation attacks, side channels, and environment-correlated errors.These factors can invalidate simplistic independence assumptions in joint-system analysis.Source: D. Biometric Challenges and Limitations · p. 12
• A PUF derives device identity from manufacturing variation rather than a conventionally stored secret, producing challenge–response behavior tied to the physical instance.The response also depends on challenge, environment, and aging effects.Source: A. Complete PUF Processing Chain · p. 12
• Practical PUF processing digitizes physical behavior, filters unstable responses, generates helper data, performs error correction, and derives a stable key or credential.The complete path is summarized from the physical entropy source through raw and stable responses to final output.Source: A. Complete PUF Processing Chain · p. 12, Figure 5 · p. 13
• PUF stabilization through repeated measurement or majority voting improves reliability but increases enrollment time, latency, energy, and metadata storage.Error correction adds redundancy, decoding logic, helper data, and latency as the correction radius grows.Source: 3) Stability Filtering and… · p. 13, 4) Helper Data, Secure Sketches, and… · p. 13
• Helper-data manipulation can alter decoding behavior or reduce effective security, so passive exposure alone is insufficient for PUF fuzzy-extractor analysis.Explicit helper-data masking has been proposed in response to this threat.Source: 4) Helper Data, Secure Sketches, and… · pp. 13–14

B. Weak and Strong PUFs

• Weak PUFs expose limited effectively independent responses and are mainly suited to local key generation or device fingerprinting.SRAM and many memory-based PUFs commonly fall into this category.Source: B. Weak and Strong PUFs · p. 14
• Strong PUFs provide much larger challenge spaces and are intended to support authentication through many challenge–response pairs.Arbiter-derived constructions are canonical examples.Source: B. Weak and Strong PUFs · p. 14
• A large challenge–response space does not guarantee unpredictability because machine-learning models can approximate several strong PUF constructions from observed CRPs.Neural-network attacks extended modeling capability against multiple arbiter-PUF variants.Source: B. Weak and Strong PUFs · p. 14, D. Modeling-Attack Evaluation · p. 15
• PUF assessment must report statistical response quality alongside environmental stability, helper-data security, side-channel exposure, and modeling resistance.ISO/IEC 20897 standards provide baseline requirements and evaluation methods, but application-specific attacks require additional testing.Source: C. PUF Evaluation Metrics · p. 14
• Uniqueness, reliability, uniformity, and bit aliasing characterize device separation and response bias, but none alone establishes cryptographic independence or entropy.Ideal balanced-response references include Uniqideal = 0.5 and Unifideal = 0.5.Source: 1) Inter-Device Uniqueness · p. 14, 2) Intra-Device Reliability · p. 14, 3) Uniformity · p. 14
• Reliability should be measured across operating conditions and aging, while modeling experiments should report both prediction accuracy and CRP sample complexity.Reporting only attack accuracy can obscure how many exposed CRPs are needed to reach it.Source: 6) Environmental Robustness · p. 15, D. Modeling-Attack Evaluation · p. 15

Storage overhead

• PUF key-generation storage includes selected-response data, ECC redundancy, and helper data, while the derived secret need not be stored persistently.The relevant quantities include Lraw, Lsel, ECC parameters, and Shelper = |W|.Source: E. Helper-Data and ECC Overhead · p. 15

Cross-layer correction

• Combining biometric and PUF layers can require separate error-correction procedures, motivating joint reliability selection before expensive decoding.The paper identifies total correction latency as a cross-layer cost and recommends screening reliability jointly.Source: E. Helper-Data and ECC Overhead · p. 15

Platform dependence

• PUF evaluation cost depends on whether the physical structure already exists in the target platform and on the required measurement process.Memory PUFs can reuse existing memory, whereas DRAM PUFs may require repeated accesses and controlled retention or timing conditions.Source: F. PUF Computational and Hardware Cost · p. 15

Latency

• Increasing the RO-PUF measurement window can improve frequency-estimation confidence but directly increases authentication latency.The latency model includes stimulation, measurement, digitization, filtering, ECC, and extraction stages.Source: F. PUF Computational and Hardware Cost · p. 15

Security boundaries

• PUF uniqueness and reliability do not guarantee cryptographic unpredictability, especially for strong PUFs vulnerable to response-modeling attacks.Environmental variation, helper-data manipulation, side channels, and fault injection also require explicit threat-model coverage.Source: G. Security Challenges and Limitations · p. 16

Key-dependent behavior

• The authorized key satisfies FL(x, K*) = F(x), whereas incorrect keys should differ from F(x) over a substantial portion of the input space.Correct activation is necessary but insufficient unless wrong-key behavior is meaningfully corrupted.Source: 3) Locked Circuit and Key-Dependent… · p. 17

Oracle-guided evaluation

• SAT attacks use distinguishing input patterns and oracle outputs to eliminate inconsistent key candidates until remaining keys are functionally equivalent.Recommended reporting includes TSAT, NDIP, and Nquery rather than key length alone.Source: C. Oracle-Guided SAT Attacks · p. 18

Approximate attacks

• Approximate attacks can recover keys that are not exact but reproduce most intended functionality, particularly when corruption is confined to rare input patterns.AppSAT exemplifies early termination before exact SAT convergence.Source: D. Approximate Attacks · p. 18

Structural attacks

• Structural attacks can identify and remove protection logic without recovering the intended key, so functional corruption must be paired with removal-success analysis.Topology, gate types, fan-in/fan-out, symmetry, and synthesis artifacts may expose locking structures.Source: E. Structural and Removal Attacks · p. 18

Runtime activation

• Activation security depends on protecting the key across storage, loading, transfer, and hardware interfaces, including when biometric or PUF-derived keys are used.Exposure between the key-derivation unit and locked hardware can negate individually secure upstream primitives.Source: F. Physical and Side-Channel Attacks · p. 18, G. Obfuscation Evaluation Metrics · p. 18

Key sensitivity

• Low key sensitivity indicates that some activation bits have little functional influence and may be structurally or functionally weak.Sensitivity can be examined by inverting individual bits of the authorized key.Source: 2) Key Sensitivity · p. 19

Evaluation metrics

• A rigorous evaluation should report exact and approximate attack success, query complexity, distinguishing inputs, timeouts, key sensitivity, corruption, and implementation overhead.The relevant attack metrics include Tattack, Nquery, NDIP, PKR, and Papprox.Source: 3) Attack Success and Complexity · p. 19

Implementation overhead

• Hardware protection must be assessed against unlocked-design area, delay, and power baselines, while runtime cost includes key loading or reconstruction.Reconfiguration time can be non-negligible for FPGA, eFPGA, and bitstream-based protection.Source: 4) Power–Performance–Area Overhead · p. 19

Integrated architecture

• Functional authorization cost cannot always be separated from the human and device roots of trust in the integrated architecture.The architecture treats authorization as a coupled cost across the complete chain.Source: 4) Power–Performance–Area Overhead · p. 19, §VII · p. 20

Design trade-offs

• Logic-locking families trade solver resistance, wrong-key corruption, structural protection, and implementation complexity rather than optimizing one universally dominant property.Random XOR/XNOR, SARLock- or Anti-SAT-like, and approximation-aware designs occupy different points in this trade-off space.Source: H. Security–Corruption–Cost Trade-Off · p. 19, §I · p. 19

Implementation effects

• Security can be overestimated when evaluation stops at RTL because synthesis and physical implementation may alter protection topology and key observability.Post-synthesis netlists, and ideally post-layout implementations, should be examined.Source: §I · pp. 19–20

Error propagation

• Direct XOR fusion propagates biometric and PUF bit errors, while a cryptographic KDF can produce unrelated output after even one incorrect input bit.The cited error equation applies to direct bitwise fusion, not to cryptographic KDF error probabilities.Source: 1) Reliability Propagation · p. 21

Stable reconstruction

• Both biometric and PUF sources should be reconstructed into stable forms before cryptographic fusion.Successful binding depends on successful reconstruction at both layers, with direct measurement required when errors are correlated.Source: 1) Reliability Propagation · p. 21

Enrollment and runtime

• Enrollment establishes biometric reliability parameters and PUF response reliability information, while raw biometric measurements and raw device secrets need not be stored as plaintext.Runtime exposes the final binding secret only after both factors are successfully reconstructed.Source: 2) Implementation · pp. 21–22

PUF–obfuscation binding

• PUF-derived activation keys bind correct hardware functionality to the enrolled physical device, leaving a copied netlist locked on another device.The transferred device is expected to generate a different PUF response and consequently a different activation key.Source: B. PUF + Hardware Obfuscation:… · p. 22

Interface protection

• The KDF-to-locking interface must remain inside the trusted hardware boundary, and helper-data integrity is required because altered helper data can corrupt activation-key reconstruction.Probing, scan access, debug interfaces, side channels, or malicious helper-data modification can bypass or disrupt the binding.Source: 1) Implementation · p. 22

Biometric–obfuscation binding

• Biometric-controlled hardware activation requires exact biometric reconstruction because approximate similarity is insufficient for deriving the correct functional key.Quantization, fuzzy extraction, secure sketches, or other error-tolerant reconstruction must precede activation.Source: C. Biometric + Hardware Obfuscation:… · p. 22

• C7 requires correct functionality only when an authorized human interacts with the intended physical device and the joint credential activates the protected function.Source: D. Biometric + PUF + Obfuscation: C7… · p. 22
• The runtime chain derives biometric material, uses it to define a PUF challenge, fuses stable biometric and PUF components, and derives a domain-separated activation key.Source: 1) Stage 1: Human-Derived Secret · p. 22, 2) Stage 2: Biometric-Dependent Device… · p. 22, 3) Stage 3: Human–Device Binding Secret · p. 22
• A stable human–device binding secret supports static locking, while fresh nonces generate session authenticators without changing the static activation key.Source: 3) Stage 3: Human–Device Binding Secret · p. 22, 5) Session Freshness Without Changing… · p. 23
• A wrapped-key variant keeps the logic-locking key fixed and allows reconstructed binding material to decrypt it for circuit activation.Source: 6) Alternative: Wrapped Activation Key · p. 23
• End-to-end activation requires successful biometric, PUF, and activation-key reconstruction, with the design targeting both LAFR →0 and UAR →0.Source: 7) Runtime Integration Protocol · p. 23, 8) End-to-End Correctness · p. 23

Implementation Trust Boundaries

• Each interface carries security-sensitive material, and exposure of the KDF-to-locking value can bypass both biometric and PUF roots of trust.Source: 9) Implementation Trust Boundaries · p. 23
• Short-lived intermediate values and protection against software buffers, debug interfaces, scan chains, and configuration buses reduce exposure during activation.Source: 9) Implementation Trust Boundaries · p. 23

Cross-Layer Failure Propagation

• Compromise can form attack chains from biometric leakage to PUF querying and modeling, derived binding secrets, and hardware activation-key recovery.Source: E. Cross-Layer Failure Propagation · p. 23
• A secure composition requires formal models and benchmarks because individual biometric, PUF, and locking security claims do not automatically compose.Source: E. Cross-Layer Failure Propagation · pp. 23–24, A. Compositional Security · p. 24

Lifecycle and Revocation

• Ownership transfer and device replacement must support new human–device bindings without exposing reusable biometric information or replacing physiological traits.Source: B. Revocable Human–Device Credentials · p. 24

Joint Optimization

• Joint optimization can select biometric and PUF features using entropy, reconstruction error, and leakage penalties rather than optimizing both layers independently.Source: C. Joint Reliability Optimization · p. 24

Standardized Benchmarks

• PUF evaluation should vary attacker knowledge, CRP budget, architecture knowledge, environmental side information, and adaptive querying.Source: D. Learning-Resistant PUFs and… · p. 24
• A standardized benchmark should combine biometric, bio-key, PUF, locking, PPA, side-channel, enrollment, and revocation metrics for the same end-to-end implementation.Source: H. Standardized Benchmarks · p. 24, §IX · p. 25