Conference paper Open Access

Efficient Fuzzy Extraction of PUF-Induced Secrets: Theory and Applications

Delvaux, Jeroen; Gu, Dawu; Verbauwhede, Ingrid; Hiller, Matthias; Yu, Meng-Day

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Delvaux, Jeroen</dc:creator>
  <dc:creator>Gu, Dawu</dc:creator>
  <dc:creator>Verbauwhede, Ingrid</dc:creator>
  <dc:creator>Hiller, Matthias</dc:creator>
  <dc:creator>Yu, Meng-Day</dc:creator>
  <dc:description>The device-unique response of a physically unclonable function (PUF) can serve as the root of trust in an embedded cryptographic system. Fuzzy extractors transform this noisy non-uniformly distributed secret into a stable high-entropy key. The overall efficiency thereof, typically depending on error-correction with a binary [n; k; d] block code, is determined by the universal and well-known (n - k) bound on the min-entropy loss. We derive new considerably tighter bounds for PUF-induced

distributions that suffer from, e.g., bias or spatial correlations. The bounds are easy-to-evaluate and apply to large non-trivial codes, e.g., BCH, Hamming and Reed-Muller codes. Apart from an inherent reduction in implementation footprint, the newly developed theory also facilitates the analysis of state-of-the-art error-correction methods for PUFs. As such, we debunk the reusability claim of the reverse fuzzy extractor. Moreover, we provide proper quantitative motivation for debiasing schemes, as this was missing in the original proposals.</dc:description>
  <dc:description>H2020 644052 / HECTOR</dc:description>
  <dc:subject>fuzzy extractor, secure sketch, min-entropy, physically unclonable functions, coding theory</dc:subject>
  <dc:title>Efficient Fuzzy Extraction of PUF-Induced Secrets: Theory and Applications</dc:title>
All versions This version
Views 140140
Downloads 5555
Data volume 29.9 MB29.9 MB
Unique views 139139
Unique downloads 5151


Cite as