{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:02:26Z","timestamp":1784736146281,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319228457","type":"print"},{"value":"9783319228464","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22846-4_2","type":"book-chapter","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T13:50:58Z","timestamp":1439473858000},"page":"22-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["Why Attackers Win: On the Learnability of XOR Arbiter PUFs"],"prefix":"10.1007","author":[{"given":"Fatemeh","family":"Ganji","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahin","family":"Tajik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,14]]},"reference":[{"issue":"4","key":"2_CR1","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":"2_CR2","volume-title":"Computational Learning Theory","author":"M Anthony","year":"1997","unstructured":"Anthony, M.: Computational Learning Theory. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"2_CR3","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-Chervonenkis dimension. J. ACM 36(4), 929\u2013965 (1989)","journal-title":"J. ACM"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bylander, T.: Learning linear threshold functions in the presence of classification noise. In: Proceedings of the Seventh Annual Conference on Computational Learning Theory, pp. 340\u2013347 (1994)","DOI":"10.1145\/180139.181176"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-662-44709-3_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"J Delvaux","year":"2014","unstructured":"Delvaux, J., Gu, D., Schellekens, D., Verbauwhede, I.: Secure lightweight entity authentication with strong PUFs: mission impossible? In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 451\u2013475. Springer, Heidelberg (2014)"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1023\/A:1007662407062","volume":"37","author":"Y Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Large margin classification using the perceptron algorithm. Mach. Learn. 37(3), 277\u2013296 (1999)","journal-title":"Mach. Learn."},{"key":"2_CR7","unstructured":"Ganji, F., Tajik, S., Seifert, J.P.: PAC Learning of Arbiter PUFs, Security Proofs for Embedded Systems-PROOFS (2014). https:\/\/eprint.iacr.org\/2015\/378.pdf. Accessed 18 May 2015"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., Van Dijk, M., Devadas, S.: Silicon physical random functions. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 148\u2013160 (2002)","DOI":"10.1145\/586110.586132"},{"issue":"11","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1002\/cpe.805","volume":"16","author":"B Gassend","year":"2004","unstructured":"Gassend, B., Lim, D., Clarke, D., Van Dijk, M., Devadas, S.: Identification and authentication of integrated circuits. Concurrency Comput. Pract. Experience 16(11), 1077\u20131098 (2004)","journal-title":"Concurrency Comput. Pract. Experience"},{"issue":"6","key":"2_CR10","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.pmcj.2008.07.001","volume":"4","author":"G Hammouri","year":"2008","unstructured":"Hammouri, G., \u00d6zt\u00fcrk, E., Sunar, B.: A tamper-proof and lightweight authentication scheme. Pervasive Mobile Comput. 4(6), 807\u2013818 (2008)","journal-title":"Pervasive Mobile Comput."},{"key":"2_CR11","first-page":"227","volume":"8","author":"R Khardon","year":"2007","unstructured":"Khardon, R., Wachman, G.: Noise tolerant variants of the perceptron algorithm. Journal Mach. Learn. Res. 8, 227\u2013248 (2007)","journal-title":"Journal Mach. Learn. Res."},{"key":"2_CR12","unstructured":"K\u00f6mmerling, O., Kuhn, M.: Design principles for tamper-resistant security processors. In: USENIX Workshop on Smartcard Technology (1999)"},{"key":"2_CR13","unstructured":"Lee, J.W., Lim, D., Gassend, B., Suh, G.E., Van Dijk, M., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: Symposium on VLSI Circuits, 2004. Digest of Technical Papers, pp. 176\u2013179 (2004)"},{"issue":"4","key":"2_CR14","first-page":"285","volume":"2","author":"N Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Mach. Learn. 2(4), 285\u2013318 (1988)","journal-title":"Mach. Learn."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Littlestone, N.: From on-line to batch learning. In: Proceedings of the Second Annual Workshop on Computational Learning Theory, pp. 269\u2013284 (1989)","DOI":"10.1016\/B978-0-08-094829-4.50022-2"},{"key":"2_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, Heidelberg (2013)"},{"key":"2_CR17","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-14452-3_1","volume-title":"Towards Hardware-Intrinsic Security","author":"R Maes","year":"2010","unstructured":"Maes, R., Verbauwhede, I.: Physically unclonable functions a study on the state of the art and future research directions. In: Sadeghi, A.-R., Naccache, D. (eds.) Towards Hardware-Intrinsic Security. Information Security and Cryptography, pp. 3\u201337. Springer, Heidelberg (2010)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Majzoobi, M., Koushanfar, F., Devadas, S.: FPGA PUF using programmable delay lines. In: 2010 IEEE International Workshop on Information Forensics and Security (WIFS), pp. 1\u20136 (2010)","DOI":"10.1109\/WIFS.2010.5711471"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Majzoobi, M., Koushanfar, F., Potkonjak, M.: Lightweight secure PUFs. In: Proceedings of the 2008 IEEE\/ACM International Conference on Computer-Aided Design, pp. 670\u2013673 (2008)","DOI":"10.1109\/ICCAD.2008.4681648"},{"issue":"5589","key":"2_CR20","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R Pappu","year":"2002","unstructured":"Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science 297(5589), 2026\u20132030 (2002)","journal-title":"Science"},{"issue":"1","key":"2_CR21","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."},{"issue":"11","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1109\/TIFS.2013.2279798","volume":"8","author":"U Ruhrmair","year":"2013","unstructured":"Ruhrmair, U., Solter, J., Sehnke, F., Xu, X., Mahmoud, A., Stoyanova, V., Dror, G., Schmidhuber, J., Burleson, W., Devadas, S.: PUF modeling attacks on simulated and silicon data. IEEE Trans. Inf. Forensics Secur. 8(11), 1876\u20131891 (2013)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2_CR23","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":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-662-44709-3_26","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"U R\u00fchrmair","year":"2014","unstructured":"R\u00fchrmair, U., Xu, X., S\u00f6lter, J., Mahmoud, A., Majzoobi, M., Koushanfar, F., Burleson, W.: Efficient power and timing side channels for physical unclonable functions. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 476\u2013492. Springer, Heidelberg (2014)"},{"key":"2_CR25","volume-title":"Towards Hardware-Intrinsic Security: Foundations and Practice","year":"2010","unstructured":"Sadeghi, A.R., Naccache, D. (eds.): Towards Hardware-Intrinsic Security: Foundations and Practice, 1st edn. Springer, Heidelberg (2010)","edition":"1"},{"key":"2_CR26","volume-title":"Efficient Algorithms in Computational Learning Theory","author":"RA Servedio","year":"2001","unstructured":"Servedio, R.A.: Efficient Algorithms in Computational Learning Theory. Harvard University, Cambridge (2001)"},{"key":"2_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Suh, G.E., Devadas, S.: Physical unclonable functions for device authentication and secret key generation. In: Proceedings of the 44th Annual Design Automation Conference, pp. 9\u201314 (2007)","DOI":"10.1109\/DAC.2007.375043"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-3-662-44709-3_27","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"S Tajik","year":"2014","unstructured":"Tajik, S., Dietz, E., Frohmann, S., Seifert, J.-P., Nedospasov, D., Helfmeier, C., Boit, C., Dittrich, H.: Physical characterization of arbiter PUFs. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 493\u2013509. Springer, Heidelberg (2014)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Tobisch, J., Becker, G.T.: On the Scaling of Machine Learning Attacks on PUFs with Application to Noise Bifurcation (2015). https:\/\/www.emsec.rub.de\/research\/publications\/ScalingPUFCameraReady\/. Accessed 18 May 2015","DOI":"10.1007\/978-3-319-24837-0_2"},{"key":"2_CR31","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: 2014 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 124\u2013129 (2014)","DOI":"10.1109\/HST.2014.6855582"}],"container-title":["Lecture Notes in Computer Science","Trust and Trustworthy Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22846-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:34:03Z","timestamp":1676471643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22846-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228457","9783319228464"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22846-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"14 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}