{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T15:05:40Z","timestamp":1768835140505,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:00:00Z","timestamp":1588896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T00:00:00Z","timestamp":1588896000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1513239"],"award-info":[{"award-number":["1513239"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000161","name":"National Institute of Standards and Technology","doi-asserted-by":"crossref","award":["60NANB16D248"],"award-info":[{"award-number":["60NANB16D248"]}],"id":[{"id":"10.13039\/100000161","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA 9550-14-1-0351"],"award-info":[{"award-number":["FA 9550-14-1-0351"]}],"id":[{"id":"10.13039\/100000181","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":[[2021,6]]},"DOI":"10.1007\/s13389-020-00226-7","type":"journal-article","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T06:02:41Z","timestamp":1588917761000},"page":"105-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Rock\u2019n\u2019roll PUFs: crafting provably secure pufs from less secure ones (extended version)"],"prefix":"10.1007","volume":"11","author":[{"given":"Fatemeh","family":"Ganji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Tajik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Stauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Tehranipoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenic","family":"Forte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"key":"226_CR1","unstructured":"Lee, J.W., Lim, D., Gassend, B., Suh, G.E., Van\u00a0Dijk, M., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: Symposium on VLSI Circuits, Digest of Technical Papers, pp. 176\u2013179 (2004)"},{"key":"226_CR2","doi-asserted-by":"crossref","unstructured":"Sahoo, D.P., Saha, S., Mukhopadhyay, D., Chakraborty, R.S., Kapoor, H.: Composite PUF: a new design paradigm for physically unclonable functions on FPGA. In: International Symposium on Hardware-Oriented Security and Trust, pp. 50\u201355. IEEE (2014)","DOI":"10.1109\/HST.2014.6855567"},{"key":"226_CR3","unstructured":"Sahoo, D.P., Mukhopadhyay, D., Chakraborty, R.S.: Formal design of composite physically unclonable function. In: WKSH on Security Proofs for Embedded Systems, pp. 84\u201397. Santa Barbara, CA (2013)"},{"key":"226_CR4","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U., Sehnke, F., S\u00f6lter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 237\u2013249 (2010)","DOI":"10.1145\/1866307.1866335"},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Ganji, F., Tajik, S., Seifert, J.-P.: Why attackers win: on the learnability of XOR arbiter PUFs. In: Intrl Conf. on Trust and Trustworthy Computing, pp. 22\u201339. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-22846-4_2"},{"key":"226_CR6","doi-asserted-by":"crossref","unstructured":"Becker, G.T.: The gap between promise and reality: on the insecurity of XOR arbiter PUFs. In: Cryptographic Hardware and Embedded System, pp. 535\u2013555. Springer, Berlin, Heidelberg (2015)","DOI":"10.1007\/978-3-662-48324-4_27"},{"key":"226_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-017-0159-4","author":"F Ganji","year":"2017","unstructured":"Ganji, F., Tajik, S., F\u00e4\u00dfler, F., Seifert, J.P.: Having no mathematical model may not secure PUFs. J. Cryptogr. Eng. (2017). https:\/\/doi.org\/10.1007\/s13389-017-0159-4","journal-title":"J. Cryptogr. Eng."},{"key":"226_CR8","doi-asserted-by":"crossref","unstructured":"Majzoobi, M., Koushanfar, F., Devadas, S.: FPGA PUF using programmable delay lines. In: IEEE International WKSH on Information Forensics and Security, pp. 1\u20136 (2010)","DOI":"10.1109\/WIFS.2010.5711471"},{"key":"226_CR9","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Maes, R., Sadeghi, A., Standaert, O.X., Wachsmann, C.: A formalization of the security features of physical functions. In: IEEE Symposium on Security and Privacy, pp. 397\u2013412 (2011)","DOI":"10.1109\/SP.2011.10"},{"issue":"1","key":"226_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jcss.2004.01.001","volume":"69","author":"R O\u2019Donnell","year":"2004","unstructured":"O\u2019Donnell, R.: Hardness amplification within NP. J. Comput. Syst. Sci. 69(1), 68\u201394 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"226_CR11","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik\u2013Chervonenkis dimension. J. ACM 36(4), 929\u2013965 (1989)","journal-title":"J. ACM"},{"key":"226_CR12","doi-asserted-by":"crossref","unstructured":"Spenke, A., Breithaupt, R., Plaga, R.: An arbiter PUF secured by remote random reconfigurations of an FPGA. In: International Conference on Trust and Trustworthy Computing, pp. 140\u2013158. Springer (2016)","DOI":"10.1007\/978-3-319-45572-3_8"},{"key":"226_CR13","doi-asserted-by":"crossref","unstructured":"Ye, J., Gong, Y., Hu, Y., Li, X.: Polymorphic PUF: exploiting reconfigurability of CPU+ FPGA SoC to resist modeling attack. In: Asian Hardware Oriented Security and Trust Symposium, pp. 43\u201348. IEEE (2017)","DOI":"10.1109\/AsianHOST.2017.8353993"},{"key":"226_CR14","doi-asserted-by":"crossref","unstructured":"Maes, R.: An accurate probabilistic reliability model for silicon PUFs. In: Cryptographic Hardware and Embedded System, pp. 73\u201389. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-40349-1_5"},{"key":"226_CR15","doi-asserted-by":"crossref","unstructured":"Ganji, F., Tajik, S., Seifert, J.P.: A Fourier analysis based attack against physically unclonable functions. In: International Conference on Financial Cryptography and Data Security. Springer (2018)","DOI":"10.1007\/978-3-662-58387-6_17"},{"key":"226_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502781.1502786","volume":"2","author":"M Majzoobi","year":"2009","unstructured":"Majzoobi, M., Koushanfar, F., Potkonjak, M.: Techniques for design and implementation of secure reconfigurable PUFs. ACM Trans. Reconfig. Technol. Syst. 2, 1\u201333 (2009)","journal-title":"ACM Trans. Reconfig. Technol. Syst."},{"issue":"5","key":"226_CR17","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1137\/070707890","volume":"39","author":"K Matulef","year":"2010","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. SIAM J. Comput. 39(5), 2004\u20132047 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"226_CR18","first-page":"343","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D., Laird, P.: Learning from noisy examples. Mach. Learn. 2(4), 343\u2013370 (1988)","journal-title":"Mach. Learn."},{"key":"226_CR19","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., Van\u00a0Dijk, M., Devadas, S.: Controlled physical random functions. In: Computer Security Applications Conference, pp. 149\u2013160 (2002)","DOI":"10.1145\/586110.586132"},{"issue":"3","key":"226_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TC.2017.2749226","volume":"67","author":"DP Sahoo","year":"2018","unstructured":"Sahoo, D.P., Mukhopadhyay, D., Chakraborty, R.S., Nguyen, P.H.: A multiplexer-based arbiter PUF composition with enhanced reliability and security. IEEE Trans. Comput. 67(3), 403\u2013417 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"226_CR21","unstructured":"Xilinx Inc.: Vivado Design Suite User Guide. Using Constraints, UG903. https:\/\/www.xilinx.com\/support\/documentation\/sw_manuals\/xilinx2018_3\/ug903-vivado-using-constraints.pdf (2018). Accessed 29 Apr 2020"},{"key":"226_CR22","doi-asserted-by":"crossref","unstructured":"Gehrer, S., Sigl, G.: Using the reconfigurability of modern FPGAs for highly efficient PUF-based key generation. In: 2015 10th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip, pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/ReCoSoC.2015.7238105"},{"key":"226_CR23","unstructured":"Inc., T.M.: MATLAB\u2014The Language of Technical Computing. http:\/\/www.mathworks.com\/products\/matlab\/\/"},{"key":"226_CR24","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 103\u2013112 (2002)"},{"key":"226_CR25","unstructured":"Ganji, F., Tajik, S., Stauss, P., Seifert, J.-P., Forte, D., Tehranipoor, M.: Theoretical and Practical Approaches for Hardness Amplification of PUFs (2019). https:\/\/eprint.iacr.org\/2019\/534. Accessed 20 Apr 2020"},{"issue":"2","key":"226_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0890-5401(03)00135-4","volume":"187","author":"NH Bshouty","year":"2003","unstructured":"Bshouty, N.H., Jackson, J.C., Tamon, C.: Uniform-distribution attribute noise learnability. Inf. Comput. 187(2), 277\u2013290 (2003)","journal-title":"Inf. Comput."},{"issue":"3","key":"226_CR27","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM 40(3), 607\u2013620 (1993)","journal-title":"J. ACM"},{"key":"226_CR28","unstructured":"O\u2019Donnell, R.W.: Computational Applications of Noise Sensitivity. Ph.D. thesis, Massachusetts Institute of Technology (2003)"},{"key":"226_CR29","doi-asserted-by":"crossref","unstructured":"Klivans, A.R., O\u2019Donnell, R., Servedio, R.A.: Learning intersections and thresholds of halfspaces. In: Proceedings the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 177\u2013186 (2002)","DOI":"10.1109\/SFCS.2002.1181894"},{"issue":"1","key":"226_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TETC.2014.2300635","volume":"2","author":"M Rostami","year":"2014","unstructured":"Rostami, M., Majzoobi, M., Koushanfar, F., Wallach, D., Devadas, S.: Robust and reverse-engineering resilient PUF authentication and key-exchange by substring matching. IEEE Trans. Emerg. Top. Comput. 2(1), 37\u201349 (2014)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"226_CR31","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2016.2553027","author":"MD Yu","year":"2016","unstructured":"Yu, M.D., Hiller, M., Delvaux, J., Sowell, R., Devadas, S., Verbauwhede, I.: A lockdown technique to prevent machine learning on PUFs for lightweight authentication. IEEE Trans. Multi-Scale Comput. Syst. (2016). https:\/\/doi.org\/10.1109\/TMSCS.2016.2553027","journal-title":"IEEE Trans. Multi-Scale Comput. Syst."},{"key":"226_CR32","unstructured":"Delvaux, J.: Security Analysis of PUF-Based Key Generation and Entity Authentication. Ph.D. thesis, Ph. D. dissertation, Shanghai Jiao Tong University, China (2017)"},{"key":"226_CR33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","volume-title":"Boosting: Foundations and Algorithms","author":"RE Schapire","year":"2012","unstructured":"Schapire, R.E., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)"},{"key":"226_CR34","doi-asserted-by":"crossref","unstructured":"Dietterich, T.G.: Ensemble methods in machine learning. In: International WKSH on Multiple Classifier System, pp. 1\u201315. Springer (2000)","DOI":"10.1007\/3-540-45014-9_1"},{"issue":"Sep","key":"226_CR35","first-page":"633","volume":"4","author":"RA Servedio","year":"2003","unstructured":"Servedio, R.A.: Smooth boosting and learning with malicious noise. J. Mach. Learn. Res. 4(Sep), 633\u2013648 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"Dec","key":"226_CR36","first-page":"2715","volume":"10","author":"AR Klivans","year":"2009","unstructured":"Klivans, A.R., Long, P.M., Servedio, R.A.: Learning halfspaces with malicious noise. J. Mach. Learn. Res. 10(Dec), 2715\u20132740 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"226_CR37","doi-asserted-by":"crossref","unstructured":"Yu, M.D.M., Verbauwhede, I., Devadas, S., MRaihi, D.: A noise bifurcation architecture for linear additive physical functions. In: IEEE International Symposium on Hardware-Oriented Security and Trust, pp. 124\u2013129 (2014)","DOI":"10.1109\/HST.2014.6855582"},{"key":"226_CR38","doi-asserted-by":"crossref","unstructured":"Tobisch, J., Becker, G.T.: On the scaling of machine learning attacks on PUFs with application to noise bifurcation. In: International WKSH on Radio Frequency Identification: Security and Privacy Issues, pp. 17\u201331. Springer (2015)","DOI":"10.1007\/978-3-319-24837-0_2"},{"issue":"1","key":"226_CR39","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01300374","volume":"14","author":"SA Goldman","year":"1995","unstructured":"Goldman, S.A., Sloan, R.H.: Can PAC learning algorithms tolerate random attribute noise? Algorithmica 14(1), 70\u201384 (1995)","journal-title":"Algorithmica"},{"issue":"6","key":"226_CR40","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1109\/TCSI.2013.2290845","volume":"61","author":"J Delvaux","year":"2014","unstructured":"Delvaux, J., Verbauwhede, I.: Fault injection modeling attacks on 65 nm Arbiter and RO sum PUFs via environmental changes. IEEE Trans. Circuits Syst. I 61(6), 1701\u20131713 (2014)","journal-title":"IEEE Trans. Circuits Syst. I"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-020-00226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-020-00226-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-020-00226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T08:36:31Z","timestamp":1666514191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-020-00226-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s13389-020-00226-7","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,8]]},"assertion":[{"value":"15 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}