{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:23:23Z","timestamp":1740162203690,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003005","name":"Eindhoven University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003005","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s13389-018-0183-z","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T19:48:44Z","timestamp":1519415324000},"page":"341-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A trivial debiasing scheme for Helper Data Systems"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1409-4127","authenticated-orcid":false,"given":"Boris","family":"\u0160kori\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"unstructured":"http:\/\/gjrand.sourceforge.net\/","key":"183_CR1"},{"unstructured":"http:\/\/www.digicortex.net\/node\/22","key":"183_CR2"},{"key":"183_CR3","volume-title":"Applied Combinatorial Mathematics","author":"EF Beckenbach","year":"1964","unstructured":"Beckenbach, E.F.: Applied Combinatorial Mathematics. Wiley, London (1964)"},{"doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Skubiszewska, M.: Practical quantum oblivious transfer. In: CRYPTO, pp. 351\u2013366 (1991)","key":"183_CR4","DOI":"10.1007\/3-540-46766-1_29"},{"key":"183_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5040-5","volume-title":"Physical Unclonable Functions in Theory and Practice","author":"C B\u00f6hm","year":"2013","unstructured":"B\u00f6hm, C., Hofer, M.: Physical Unclonable Functions in Theory and Practice. Springer, Berlin (2013)"},{"doi-asserted-by":"crossref","unstructured":"Boyen, X.: Reusable cryptographic fuzzy extractors. In: ACM Conference on Computer and Communications Security, pp. 82\u201391 (2004)","key":"183_CR6","DOI":"10.1145\/1030083.1030096"},{"key":"183_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-49890-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Ran Canetti","year":"2016","unstructured":"Canetti, R., Fuller, B., Paneth, O., Reyzin, L., Smith, A.: Reusable fuzzy extractors for low-entropy distributions. In: Eurocrypt 2016 (2016). eprint.iacr.org\/2014\/243"},{"key":"183_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2005","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, London (2005)","edition":"2"},{"issue":"1","key":"183_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, M., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Eurocrypt 2004, volume 3027 of LNCS, pp. 523\u2013540. Springer (2004)","key":"183_CR10","DOI":"10.1007\/978-3-540-24676-3_31"},{"issue":"7","key":"183_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: ACM algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"},{"unstructured":"Gassend, B.: Physical Random Functions. Master\u2019s thesis, Massachusetts Institute of Technology (2003)","key":"183_CR12"},{"issue":"2","key":"183_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIFS.2010.2046984","volume":"5","author":"T Ignatenko","year":"2010","unstructured":"Ignatenko, T., Willems, F.M.J.: Information leakage in fuzzy commitment schemes. IEEE Trans. Inf. Forensics Secur. 5(2), 337\u2013348 (2010)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"183_CR14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/319709.319714","volume":"1999","author":"A Juels","year":"1999","unstructured":"Juels, A., Wattenberg, M.: A fuzzy commitment scheme. ACM Conf. Comput. Commun. Secur. 1999, 28\u201336 (1999)","journal-title":"ACM Conf. Comput. Commun. Secur."},{"key":"183_CR15","first-page":"44","volume":"2014","author":"P Koeberl","year":"2014","unstructured":"Koeberl, P., Li, J., Rajan, A., Wu, W.: Entropy loss in PUF-based key generation schemes: the repetition code pitfall. IEEE Int. Symp. Hardw. Oriented Secur. Trust 2014, 44\u201349 (2014)","journal-title":"IEEE Int. Symp. Hardw. Oriented Secur. Trust"},{"key":"183_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41395-7","volume-title":"Physically Unclonable Functions: Constructions, Properties and Applications","author":"R Maes","year":"2013","unstructured":"Maes, R.: Physically Unclonable Functions: Constructions, Properties and Applications. Springer, Berlin (2013)"},{"doi-asserted-by":"crossref","unstructured":"Maes, R., van\u00a0der Leest, V., van\u00a0der Sluis, E., Willems, F.M.J.: Secure key generation from biased PUFs. In: Cryptographic Hardware and Embedded Systems (CHES) 2015, volume 9293 of LNCS, pp. 517\u2013534. Springer (2015)","key":"183_CR17","DOI":"10.1007\/978-3-662-48324-4_26"},{"volume-title":"Towards Hardware-Intrinsic Security","year":"2010","unstructured":"Sadeghi, A.-R., Naccache, D. (eds.): Towards Hardware-Intrinsic Security. Springer, Berlin (2010)","key":"183_CR18"},{"doi-asserted-by":"crossref","unstructured":"Tuyls, P., Schrijen, G.-J., \u0160kori\u0107, B., van Geloven, J., Verhaegh, R., Wolters, R.: Read-proof hardware from protective coatings. In: Cryptographic Hardware and Embedded Systems (CHES) 2006, volume 4249 of LNCS, pp. 369\u2013383. Springer (2006)","key":"183_CR19","DOI":"10.1007\/11894063_29"},{"key":"183_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-984-2","volume-title":"Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting","author":"P Tuyls","year":"2007","unstructured":"Tuyls, P., \u0160kori\u0107, B., Kevenaar, T.: Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting. Springer, London (2007)"},{"issue":"5","key":"183_CR21","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1109\/TIFS.2014.2312851","volume":"9","author":"B \u0160kori\u0107","year":"2014","unstructured":"\u0160kori\u0107, B., de Vreede, N.: The spammed code offset method. IEEE Trans. Inf. Forensics Secur. 9(5), 875\u2013884 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"183_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MDT.2010.25","volume":"27","author":"M-D Yu","year":"2010","unstructured":"Yu, M.-D., Devadas, S.: Secure and robust error correction for physical unclonable functions. IEEE Design Test Comput. 27(1), 48\u201365 (2010)","journal-title":"IEEE Design Test Comput."}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-0183-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0183-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-0183-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T08:08:10Z","timestamp":1693555690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-0183-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-0183-z","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"11 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}