{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:01:44Z","timestamp":1762326104141,"version":"3.44.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["92373206"],"award-info":[{"award-number":["92373206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of Ministry of Science and Technology","award":["2024YFB3614200"],"award-info":[{"award-number":["2024YFB3614200"]}]},{"name":"Guangdong Provincial Key Lab of In-Memory Computing Chips","award":["2024B1212020002"],"award-info":[{"award-number":["2024B1212020002"]}]},{"name":"Shenzhen Science and Technology Program","award":["No. JCYJ20220818100814033, No. SGDX20230116093303006, No. KJZD20231023100201003 and No. KQTD20200820113105004"],"award-info":[{"award-number":["No. JCYJ20220818100814033, No. SGDX20230116093303006, No. KJZD20231023100201003 and No. KQTD20200820113105004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>The physical unclonable function (PUF) serves as a security primitive of circuits, which is applicable to the embedded systems with lightweight authentication function. However, the modeling attack, which estimates the unknown CRPs by establishing the mathematical model of PUF, is a real threat to the PUF based crypto-systems. Subsequently, the anti-modeling-attack PUF becomes a research hotspot. The systematic design method of secure PUF is still an open issue, although some secure PUF schemes have been proposed based on the repeated trials. This work proposes a security improvement method of PUFs to enhance the anti-modeling-attack capability. The growth function and the Vapnik-Chervonenkis (VC) dimension of PUF are defined as the indicators of PUF security. The proposed method regards the improvement of PUF as an optimization problem, which aims to obtain a PUF scheme with the better security indicators. Guided by the indicators, the proposed method is able to specify the improvement sites of PUF and the techniques to be applied. In addition, three approaches are proposed to inspire the new security improvement techniques. An improved arbiter PUF and an improved array-based PUF are designed as the instances of the results from the proposed method. Both of the improved PUF schemes have the stronger security than the original schemes.<\/jats:p>","DOI":"10.1145\/3727340","type":"journal-article","created":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T09:54:56Z","timestamp":1743501296000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A VC Dimension-Oriented Improvement Method of PUFs for the Anti-Modeling-Attack Capability"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5293-070X","authenticated-orcid":false,"given":"Yongliang","family":"Chen","sequence":"first","affiliation":[{"name":"Peking University Shenzhen Graduate School","place":["Shenzhen, China"]},{"name":"ChangXin Memory Technologies Co Ltd","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3382-3703","authenticated-orcid":false,"given":"Xiaole","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University Shenzhen Graduate School","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9539-1427","authenticated-orcid":false,"given":"Sunrui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University Shenzhen Graduate School","place":["Shenzhen, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-8839","authenticated-orcid":false,"given":"Xiaoxin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University","place":["Beijing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,12]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/IEDM.2015.7409672"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/554131"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013999503812"},{"issue":"63","key":"e_1_3_1_5_2","first-page":"1","article-title":"Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks","volume":"20","author":"Bartlett Peter L.","year":"2019","unstructured":"Peter L. Bartlett, Nick Harvey, Christopher Liaw, and Abbas Mehrabian. 2019. Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks. Journal of Machine Learning Research 20, 63 (2019), 1\u201317.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/s18020322"},{"key":"e_1_3_1_7_2","article-title":"PARLE-G: Provable automated representation and analysis framework for learnability evaluation of generic PUF compositions","author":"Chatterjee Durba","year":"2023","unstructured":"Durba Chatterjee, Aritra Hazra, and Debdeep Mukhopadhyay. 2023. PARLE-G: Provable automated representation and analysis framework for learnability evaluation of generic PUF compositions. IEEE Transactions on Computers 74, 3 (2023), 820\u2013834.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_1_8_2","unstructured":"Durba Chatterjee Debdeep Mukhopadhyay and Aritra Hazra. 2020. Interpose PUF can be PAC Learned. Cryptology ePrint Archive Paper 2020\/471. Retrieved from https:\/\/eprint.iacr.org\/2020\/471"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415647"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3254434"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453688.3461501"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/3235119"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-016-0119-4"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-020-00226-7"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-020-0372-5"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586132"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2019.2935465"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"David Haussler and Manfred Warmuth. 2018. The probably approximately correct (PAC) and other learning models. The Mathematics of Generalization (2018) 17\u201336.","DOI":"10.1201\/9780429492525-3"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2320516"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.23919\/VLSIC.2017.8008504"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2023.104989"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/VLSIC.2004.1346548"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/OJNANO.2021.3058169"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.859470"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.859470"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3197539"},{"key":"e_1_3_1_27_2","unstructured":"Phuong Ha Nguyen Durga Prasad Sahoo Chenglu Jin Kaleel Mahmood Ulrich R\u00fchrmair and Marten van Dijk. 2018. The interpose PUF: Secure PUF design against state-of-the-art machine learning attacks. Cryptology ePrint Archive Paper 2018\/350. Retrieved from https:\/\/eprint.iacr.org\/2018\/350"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-61486-6_5"},{"key":"e_1_3_1_29_2","first-page":"454","volume-title":"Proceedings of the IFIP International Internet of Things Conference","author":"Rajput Shailesh","year":"2023","unstructured":"Shailesh Rajput and Jaya Dofe. 2023. Secure dynamic PUF for IoT security. In Proceedings of the IFIP International Internet of Things Conference. Springer, 454\u2013462."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2279798"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3032624"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3032624"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2018.00096"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2962115"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2022.3212271"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278484"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2021.3062413"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TED.2021.3066087"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/HOST54066.2022.9839791"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3197696"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942176"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3207119"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3267657"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3372801"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3727340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:44:06Z","timestamp":1757677446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3727340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,12]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3727340"],"URL":"https:\/\/doi.org\/10.1145\/3727340","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2025,9,12]]},"assertion":[{"value":"2024-03-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}