{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:36:54Z","timestamp":1764175014679,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2021,7,31]]},"abstract":"<jats:p>\n            Physical Unclonable Functions (PUFs) exploit the manufacturing process variations inherent in silicon-based chips to generate unique secret keys. Although PUFs are supposed to be unclonable or unbreakable, researchers have found that they are vulnerable to machine learning (ML) attacks. In this article, we analyze the vulnerability of different FPGA-based Ring Oscillator PUFs (ROPUFs) to machine learning attacks. The challenge-response pairs (CRPs) data obtained from different ROPUFs is trained using different machine learning algorithms. From the study, it is found that the Artificial Neural Network (ANN) models can be used to train the ROPUFs with a training accuracy of 99.9% and a prediction accuracy of 62% when 5,000 CRPs are used for a\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            challenge-response ROPUF. In this article, we assume a realistic situation where a small set of the CRP dataset (approximately 15% maximum) is unscrupulously obtained by the hacker. A prediction accuracy of 62% makes the PUF vulnerable to machine learning attacks. Therefore, a secondary goal of this article is the design of a ROPUF capable of thwarting machine learning modeling attacks. The modified XOR-inverter ROPUF drastically reduces the prediction accuracy from 62% to 13.1%, thus making it increasingly difficult for hackers to attack the ROPUF.\n          <\/jats:p>","DOI":"10.1145\/3445978","type":"journal-article","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T13:59:37Z","timestamp":1620741577000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Machine Learning Vulnerability Analysis of FPGA-based Ring Oscillator PUFs and Counter Measures"],"prefix":"10.1145","volume":"17","author":[{"given":"Noor Ahmad","family":"Hazari","sequence":"first","affiliation":[{"name":"University of Toledo, Toledo, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6069-9261","authenticated-orcid":false,"given":"Ahmed","family":"Oun","sequence":"additional","affiliation":[{"name":"University of Toledo, Toledo, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Niamat","sequence":"additional","affiliation":[{"name":"University of Toledo, Toledo, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2332291"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2017.7951827"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2334493"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2541735"},{"volume-title":"Introduction to Hardware Security and Trust","author":"Koushanfar Farinaz","key":"e_1_2_1_5_1","unstructured":"Farinaz Koushanfar . 2012. Hardware metering: A survey . In Introduction to Hardware Security and Trust . Springer , New York, NY , 103\u2013122 Farinaz Koushanfar. 2012. Hardware metering: A survey. In Introduction to Hardware Security and Trust. Springer, New York, NY, 103\u2013122"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278484"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2017.8053080"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2582423"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272361"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2015.7282135"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2017.8053080"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2279798"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAECON.2018.8556818"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the Annual International Conference on Information Security and Cryptology (ICISC\u201915)","author":"Ganji Fatemeh","year":"2015","unstructured":"Fatemeh Ganji , Shahin Tajik , and Jean-Pierre Seifert . 2015 . Let me prove it to you: RO PUFs are provably learnable . In Proceedings of the Annual International Conference on Information Security and Cryptology (ICISC\u201915) . Springer, Cham, 345\u2013358. Fatemeh Ganji, Shahin Tajik, and Jean-Pierre Seifert. 2015. Let me prove it to you: RO PUFs are provably learnable. In Proceedings of the Annual International Conference on Information Security and Cryptology (ICISC\u201915). Springer, Cham, 345\u2013358."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2019.8885037"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2022245.2022250"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-016-0119-4"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2013.6581563"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2016.21"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8714862"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2891223"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2962115"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2448677"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2018.8383921"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2014.2300635"},{"volume-title":"Proceedings of the IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops\u201916)","author":"Gao Yansong","key":"e_1_2_1_26_1","unstructured":"Yansong Gao , Gefei Li , Hua Ma , Said F. Al-Sarawi , Omid Kavehei , Derek Abbott , and Damith C. Ranasinghe . 2016. Obfuscated challenge-response: A secure lightweight authentication mechanism for PUF-based pervasive devices . In Proceedings of the IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops\u201916) . IEEE, 1\u20136. Yansong Gao, Gefei Li, Hua Ma, Said F. Al-Sarawi, Omid Kavehei, Derek Abbott, and Damith C. Ranasinghe. 2016. Obfuscated challenge-response: A secure lightweight authentication mechanism for PUF-based pervasive devices. In Proceedings of the IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops\u201916). IEEE, 1\u20136."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2018.2877737"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAECON.2017.8268749"},{"volume-title":"Proceedings of the International Conference on Field-Programmable Technology. IEEE, 138\u2013145","author":"Yu Haile","key":"e_1_2_1_29_1","unstructured":"Haile Yu , Qiang Xu , and Philip H. W. Leong . 2010. Fine-grained characterization of process variation in FPGAs . In Proceedings of the International Conference on Field-Programmable Technology. IEEE, 138\u2013145 . Haile Yu, Qiang Xu, and Philip H. W. Leong. 2010. Fine-grained characterization of process variation in FPGAs. In Proceedings of the International Conference on Field-Programmable Technology. IEEE, 138\u2013145."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2010.24"},{"volume-title":"Embedded Systems Design with FPGAs","author":"Maiti Abhranil","key":"e_1_2_1_31_1","unstructured":"Abhranil Maiti , Vikash Gunreddy , and Patrick Schaumont . 2013. A systematic method to evaluate and compare the performance of physical unclonable functions . In Embedded Systems Design with FPGAs . Springer , New York, NY , 245\u2013267. Abhranil Maiti, Vikash Gunreddy, and Patrick Schaumont. 2013. A systematic method to evaluate and compare the performance of physical unclonable functions. In Embedded Systems Design with FPGAs. Springer, New York, NY, 245\u2013267."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00048682"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9272-4"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.06.004"},{"volume-title":"Classic Works of the Dempster-Shafer Theory of Belief Functions","author":"Denoeux Thierry","key":"e_1_2_1_35_1","unstructured":"Thierry Denoeux . 2008. A k-nearest neighbor classification rule based on Dempster-Shafer theory . In Classic Works of the Dempster-Shafer Theory of Belief Functions . Springer , Berlin , 737\u2013760. Thierry Denoeux. 2008. A k-nearest neighbor classification rule based on Dempster-Shafer theory. In Classic Works of the Dempster-Shafer Theory of Belief Functions. Springer, Berlin, 737\u2013760."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-2070(94)90045-0"},{"key":"e_1_2_1_38_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba . 2014 . Adam : A method for stochastic optimization. Retrieved from https:\/\/arXiv:1412.6980. Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. Retrieved from https:\/\/arXiv:1412.6980."},{"key":"e_1_2_1_39_1","unstructured":"Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. Retrieved from https:\/\/arXiv:1609.04747.  Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. Retrieved from https:\/\/arXiv:1609.04747."},{"key":"e_1_2_1_40_1","volume-title":"Corrado, et\u00a0al","author":"Abadi Mart\u00edn","year":"2016","unstructured":"Mart\u00edn Abadi , Ashish Agarwal , Paul Barham , Eugene Brevdo , Zhifeng Chen , Craig Citro , and Greg S . Corrado, et\u00a0al . 2016 . Tensorflow : Large-scale machine learning on heterogeneous distributed systems. Retrieved from https:\/\/arXiv:1603.04467. Mart\u00edn Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, and Greg S. Corrado, et\u00a0al. 2016. Tensorflow: Large-scale machine learning on heterogeneous distributed systems. Retrieved from https:\/\/arXiv:1603.04467."},{"key":"e_1_2_1_41_1","article-title":"A new arbiter PUF for enhancing unpredictability on FPGA. Sci","volume":"864812","author":"Takanori Machida M. I.","year":"2015","unstructured":"M. I. Takanori Machida , Dai Yamamoto , and K. Sakiyama . 2015 . A new arbiter PUF for enhancing unpredictability on FPGA. Sci . World J. Article 864812 (2015), 13 pages. https:\/\/doi.org\/10.1155\/2015\/864812. 10.1155\/2015 M. I. Takanori Machida, Dai Yamamoto, and K. Sakiyama. 2015. A new arbiter PUF for enhancing unpredictability on FPGA. Sci. World J. Article 864812 (2015), 13 pages. https:\/\/doi.org\/10.1155\/2015\/864812.","journal-title":"World J. Article"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3445978","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3445978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:25Z","timestamp":1750197805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3445978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,11]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7,31]]}},"alternative-id":["10.1145\/3445978"],"URL":"https:\/\/doi.org\/10.1145\/3445978","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"type":"print","value":"1550-4832"},{"type":"electronic","value":"1550-4840"}],"subject":[],"published":{"date-parts":[[2021,5,11]]},"assertion":[{"value":"2020-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}