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


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">fuzzy extractor, secure sketch, min-entropy, physically unclonable functions, coding theory</subfield>
  </datafield>
  <controlfield tag="005">20170908083401.0</controlfield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">H2020 644052 / HECTOR</subfield>
  </datafield>
  <controlfield tag="001">55449</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">17-19 August 2016</subfield>
    <subfield code="g">CHES 2016</subfield>
    <subfield code="a">Conference on Cryptographic Hardware and Embedded Systems 2016</subfield>
    <subfield code="c">Santa Barbara, USA</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Shanghai Jiao Tong University</subfield>
    <subfield code="a">Gu, Dawu</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">KU Leuven</subfield>
    <subfield code="a">Verbauwhede, Ingrid</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Technische Universität München</subfield>
    <subfield code="a">Hiller, Matthias</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Verayo Inc.</subfield>
    <subfield code="a">Yu, Meng-Day</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">544272</subfield>
    <subfield code="z">md5:bc1e39fa69088484a87d933117948df9</subfield>
    <subfield code="u">https://zenodo.org/record/55449/files/HECTOR-Fuzzy-Extraction-PUF-2016.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">http://www.chesworkshop.org/ches2016/</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2016-08-17</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-hector</subfield>
    <subfield code="p">user-ecfunded</subfield>
    <subfield code="o">oai:zenodo.org:55449</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">KU Leuven</subfield>
    <subfield code="a">Delvaux, Jeroen</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Efficient Fuzzy Extraction of PUF-Induced Secrets: Theory and Applications</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-ecfunded</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-hector</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">644052</subfield>
    <subfield code="a">HARDWARE ENABLED CRYPTO AND RANDOMNESS</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://creativecommons.org/licenses/by-nc-sa/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution Non Commercial Share Alike 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;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&lt;/p&gt;

&lt;p&gt;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.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.55449</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
76
21
views
downloads
All versions This version
Views 7676
Downloads 2121
Data volume 11.4 MB11.4 MB
Unique views 7676
Unique downloads 1919

Share

Cite as