{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:27:57Z","timestamp":1755224877973,"version":"3.43.0"},"reference-count":28,"publisher":"World Scientific Pub Co Pte Ltd","issue":"16","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62362068"],"award-info":[{"award-number":["62362068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018531","name":"Major Science and Technology Projects in Yunnan Province","doi-asserted-by":"publisher","award":["202302AD080006"],"award-info":[{"award-number":["202302AD080006"]}],"id":[{"id":"10.13039\/501100018531","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2025,11,15]]},"abstract":"<jats:p> Dynamic neural networks (DyNNs) are able to adapt their executions\/routines according to various difficulties of inputs while not significantly sacrificing accuracy. Such adaptivity makes them an emerging alternative of efficient networks for resource-constraint devices, thus receiving increasing attention. However, the adaptivity also poses a new robust challenge to DyNNs, i.e., efficiency or slowdown attacks which stealthily manipulate inputs to slow down DyNNs, thus undermining the superiority of DyNNs. In this paper, we investigate the slowdown backdoor attack on DyNNs and propose a new attack method. Different from the state of the art, the proposed attack method implements input-aware backdoor triggers, which are generated using two generators from a generator-discriminator architecture. We extensively evaluate the proposed attack method in comparison with the state of the art. Experimental results show that our attack method can achieve better attack effectiveness in terms of two slowdown attack metrics. The poisoned model significantly increases the average number of computational blocks by up to 4.4 times over the clean counterpart while only slightly degrading the accuracy and efficiency of the model under clean data. Our code and models are available at https:\/\/github.com\/zhiqianguan\/dynn_backdoor . <\/jats:p>","DOI":"10.1142\/s0218126625502834","type":"journal-article","created":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T05:24:46Z","timestamp":1741238686000},"source":"Crossref","is-referenced-by-count":0,"title":["Input-Aware Slowdown Backdoor Attack on Dynamic Neural Networks"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2415-3739","authenticated-orcid":false,"given":"Zhi-Qian","family":"Guan","sequence":"first","affiliation":[{"name":"School of Software, Yunnan University, Kunming, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0666-2887","authenticated-orcid":false,"given":"Jing","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7986-2222","authenticated-orcid":false,"given":"Zhenli","family":"He","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1210-1135","authenticated-orcid":false,"given":"Shengfa","family":"Miao","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming, P.\u00a0R.\u00a0China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4365-2768","authenticated-orcid":false,"given":"Di","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, NTNU, Trondheim, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2025,6,21]]},"reference":[{"key":"S0218126625502834BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"S0218126625502834BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"S0218126625502834BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01427"},{"first-page":"3301","volume-title":"Int. Conf. Machine Learning (PMLR, 2019)","author":"Kaya Y.","key":"S0218126625502834BIB004"},{"key":"S0218126625502834BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.04.141"},{"key":"S0218126625502834BIB006","first-page":"1234","volume":"43","author":"Hou X.","year":"2024","journal-title":"IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst."},{"key":"S0218126625502834BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3117837"},{"key":"S0218126625502834BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7900006"},{"key":"S0218126625502834BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00244"},{"key":"S0218126625502834BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01261-8_25"},{"key":"S0218126625502834BIB011","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774567"},{"key":"S0218126625502834BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.02355"},{"key":"S0218126625502834BIB014","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"S0218126625502834BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2909068"},{"key":"S0218126625502834BIB016","first-page":"3454","volume":"33","author":"Nguyen T. A.","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"S0218126625502834BIB018","first-page":"2088","volume":"18","author":"Li S.","year":"2020","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"S0218126625502834BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2022.3201472"},{"key":"S0218126625502834BIB020","volume-title":"Pattern Classification and Scene Analysis","volume":"3","author":"Duda R. O.","year":"1973"},{"key":"S0218126625502834BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1986.4767851"},{"key":"S0218126625502834BIB022","doi-asserted-by":"publisher","DOI":"10.1145\/3374664.3375751"},{"key":"S0218126625502834BIB024","doi-asserted-by":"publisher","DOI":"10.1145\/3460319.3464809"},{"key":"S0218126625502834BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3110239"},{"key":"S0218126625502834BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.17"},{"key":"S0218126625502834BIB029","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3182979"},{"key":"S0218126625502834BIB030","doi-asserted-by":"publisher","DOI":"10.1007\/11494669_93"},{"key":"S0218126625502834BIB031","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01493"},{"key":"S0218126625502834BIB033","volume-title":"Grundz\u00fcge der Mengenlehre","volume":"7","author":"Hausdorff F.","year":"1914"},{"volume-title":"The Eleventh Int. Conf. Learning Representations","year":"2023","author":"Huang H.","key":"S0218126625502834BIB034"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126625502834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T02:31:30Z","timestamp":1755052290000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218126625502834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,21]]},"references-count":28,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,11,15]]}},"alternative-id":["10.1142\/S0218126625502834"],"URL":"https:\/\/doi.org\/10.1142\/s0218126625502834","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"type":"print","value":"0218-1266"},{"type":"electronic","value":"1793-6454"}],"subject":[],"published":{"date-parts":[[2025,6,21]]},"article-number":"2550283"}}