{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:18:16Z","timestamp":1780546696057,"version":"3.54.1"},"reference-count":27,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:00:00Z","timestamp":1620691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["Eurostars E!11897"],"award-info":[{"award-number":["Eurostars E!11897"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.<\/jats:p>","DOI":"10.3390\/e23050590","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T04:05:32Z","timestamp":1620705932000},"page":"590","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multiple Observations for Secret-Key Binding with SRAM PUFs"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6030-4135","authenticated-orcid":false,"given":"Lieneke","family":"Kusters","sequence":"first","affiliation":[{"name":"Information and Communication Theory Lab, Signal Processing Systems Group, Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7316-3471","authenticated-orcid":false,"given":"Frans M. J.","family":"Willems","sequence":"additional","affiliation":[{"name":"Information and Communication Theory Lab, Signal Processing Systems Group, Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1126\/science.1074376","article-title":"Physical One-Way Functions","volume":"297","author":"Pappu","year":"2002","journal-title":"Science"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., van Dijk, M., and Devadas, S. (2002, January 18\u201322). Silicon physical random functions. Proceedings of the 9th ACM Conference on Computer and Communications Security\u2014CCS, Washington, DC, USA.","DOI":"10.1145\/586110.586132"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1109\/TC.2008.212","article-title":"Power-Up SRAM state as an identifying fingerprint and source of true random numbers","volume":"58","author":"Holcomb","year":"2009","journal-title":"IEEE Trans. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Guajardo, J., Kumar, S.S., Schrijen, G.J., and Tuyls, P. (2007). FPGA Intrinsic PUFs and Their Use for IP Protection. Cryptographic Hardware Embedded System\u2014CHES, Springer.","DOI":"10.1007\/978-3-540-74735-2_5"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"van den Berg, R., \u0160kori\u0107, B., and van der Leest, V. (2013, January 4). Bias-based modeling and entropy analysis of PUFs. Proceedings of the 3rd Int. Workshop Trustworthy Embedded Devices\u2014TrustED, Berlin, Germany.","DOI":"10.1145\/2517300.2517301"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Juels, A., and Wattenberg, M. (1999, January 1\u20134). A fuzzy commitment scheme. Proceedings of the 6th ACM Conference on Computer and Communications Security\u2014CCS, Singapore.","DOI":"10.1145\/319709.319714"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Maes, R., Tuyls, P., and Verbauwhede, I. (July, January 28). A soft decision helper data algorithm for SRAM PUFs. Proceedings of the 2009 IEEE International Symposium on Information Theory, Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205263"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Maes, R., Tuyls, P., and Verbauwhede, I. (2009). Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs. Cryptographic Hardware and Embedded System\u2014CHES, Springer.","DOI":"10.1109\/ISIT.2009.5205263"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MDT.2010.25","article-title":"Secure and robust error correction for physical unclonable functions","volume":"27","author":"Yu","year":"2010","journal-title":"IEEE Des. Test Comput."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hiller, M., Merli, D., Stumpf, F., and Sigl, G. (2012, January 3\u20134). Complementary IBS: Application specific error correction for PUFs. Proceedings of the 2012 IEEE International Symposium on Hardware-Oriented Security and Trust, San Francisco, CA, USA.","DOI":"10.1109\/HST.2012.6224310"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2065","DOI":"10.1109\/TIFS.2016.2573766","article-title":"Cherry-Picking Reliable PUF Bits with Differential Sequence Coding","volume":"11","author":"Hiller","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1109\/TIFS.2018.2886624","article-title":"Lightweight (Reverse) Fuzzy Extractor With Multiple Reference PUF Responses","volume":"14","author":"Gao","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2872","DOI":"10.1109\/TIFS.2018.2834303","article-title":"Privacy, Secrecy, and Storage with Multiple Noisy Measurements of Identifiers","volume":"13","author":"Kramer","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TIFS.2020.3029885","article-title":"Multi-Entity and Multi-Enrollment Key Agreement With Correlated Noise","volume":"16","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2276","DOI":"10.1109\/TIFS.2019.2895552","article-title":"Secret-Key Capacity Regions for Multiple Enrollments With an SRAM-PUF","volume":"14","author":"Kusters","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Boyen, X. (2004, January 25\u201329). Reusable cryptographic fuzzy extractors. Proceedings of the 11th ACM Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/1030083.1030096"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Kusters, L., Ignatenko, T., Willems, F.M.J., Maes, R., van der Sluis, E., and Selimis, G. (2017, January 25\u201330). Security of helper data schemes for SRAM-PUF in multiple enrollment scenarios. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006840"},{"key":"ref_18","unstructured":"Van Herrewege, A., Katzenbeisser, S., Maes, R., Peeters, R., Sadeghi, A.R., Verbauwhede, I., and Wachsmann, C. (March, January 27). Reverse fuzzy extractors: Enabling lightweight mutual authentication for PUF-enabled RFIDs. Proceedings of the International Conference on Financial Cryptography and Data Security, Kralendijk, Bonaire."},{"key":"ref_19","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Katzenbeisser, S., Kocaba\u015f, \u00dc., Ro\u017ei\u0107, V., Sadeghi, A.R., Verbauwhede, I., and Wachsmann, C. (2012, January 9\u201312). PUFs: Myth, Fact or Busted? A Security Evaluation of Physically Unclonable Functions (PUFs) Cast in Silicon. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Leuven, Belgium.","DOI":"10.1007\/978-3-642-33027-8_17"},{"key":"ref_22","unstructured":"Maes, R. (2015, January 19\u201322). An Accurate Probabilistic Reliability Model for Silicon PUFs. Proceedings of the International Conference on Cryptographic Hardware and Embedded Systems, Santa Barbara, CA, USA."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Kusters, L., Rikos, A., and Willems, F.M.J. (July, January 29). Modeling Temperature Behavior in the Helper Data for Secret-Key Binding with SRAM PUFs. Proceedings of the 2020 IEEE Conference on Communications and Network Security (CNS), Avignon, France.","DOI":"10.1109\/CNS48642.2020.9162300"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","article-title":"Common Randomness in Information Theory & Cryptography","volume":"39","author":"Ahlswede","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/18.256484","article-title":"Secret key agreement by public discussion from common information","volume":"39","author":"Maurer","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/MVT.2018.2867640","article-title":"Channel Coding in 5G New Radio: A Tutorial Overview and Performance Comparison with 4G LTE","volume":"13","author":"Hui","year":"2018","journal-title":"IEEE Veh. Technol. Mag."},{"key":"ref_27","unstructured":"(2020). MATLAB and 5G Toolbox Release, The MathWorks, Inc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/5\/590\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:59:00Z","timestamp":1760162340000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/5\/590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,11]]},"references-count":27,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["e23050590"],"URL":"https:\/\/doi.org\/10.3390\/e23050590","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202104.0229.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,11]]}}}