{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:31:35Z","timestamp":1770139895495,"version":"3.49.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11,14]]},"DOI":"10.1109\/trustcom66490.2025.00225","type":"proceedings-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:42:41Z","timestamp":1770064961000},"page":"1944-1951","source":"Crossref","is-referenced-by-count":0,"title":["High-fidelity Dual-layer Backdoor Watermarking Scheme based on Private Model Embedding"],"prefix":"10.1109","author":[{"given":"Lingyun","family":"Xiang","sequence":"first","affiliation":[{"name":"Changsha University of Science and Technology,School of Computer Science and Technology,Changsha,China,410114"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangbo","family":"Luo","sequence":"additional","affiliation":[{"name":"Changsha University of Science and Technology,School of Computer Science and Technology,Changsha,China,410114"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangli","family":"Jin","sequence":"additional","affiliation":[{"name":"Changsha University of Science and Technology,School of Computer Science and Technology,Changsha,China,410114"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Deep intellectual property protection: A survey","author":"Sun","year":"2023"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3078971.3078974"},{"key":"ref3","article-title":"DeepMarks: A digital fingerprinting framework for deep neural networks","author":"Chen","year":"2018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2352\/issn.2470-1173.2020.4.mwsf-022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS53200.2021.9648376"},{"key":"ref6","first-page":"1615","article-title":"Turning your weakness into a strength: Watermarking deep neural networks by back-dooring","volume-title":"Proc. USENIX Secur. Symp","author":"Adi"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196550"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240862"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3359789.3359801"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-47436-2_35"},{"issue":"2","key":"ref11","first-page":"1159","article-title":"Protecting the intellectual proper-ties of deep neural networks with an additional class and steganographic images","volume":"19","author":"Sun","year":"2021","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.01457"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3250210"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/app11030999"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3443650"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2002.1014990"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2025.107907"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref19","article-title":"An overview of multi-task learning in deep neural networks","author":"Ruder","year":"2017"},{"key":"ref20","first-page":"794","article-title":"Multi-domain dialog state tracking using recurrent neural networks","volume-title":"Proc. ACL","author":"Mrkvsic"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0767-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2016.2573280"},{"key":"ref23","article-title":"Adding gradient noise improves learning for very deep networks","author":"Neelakantan","year":"2015"},{"key":"ref24","first-page":"15862","article-title":"Generalization in multitask deep neural classifiers: A statistical physics approach","volume-title":"Proc. NeurIPS","author":"Ndirango"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.05.015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICKG63256.2024.00070"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref28","article-title":"Learning multiple layers of features from tiny images","volume-title":"Tech. Rep.","author":"Krizhevsky","year":"2009"}],"event":{"name":"2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","location":"Guiyang, China","start":{"date-parts":[[2025,11,14]]},"end":{"date-parts":[[2025,11,17]]}},"container-title":["2025 IEEE 24th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11354467\/11354567\/11354878.pdf?arnumber=11354878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T06:03:38Z","timestamp":1770098618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11354878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/trustcom66490.2025.00225","relation":{},"subject":[],"published":{"date-parts":[[2025,11,14]]}}}