{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T21:05:53Z","timestamp":1783976753329,"version":"3.55.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada, the Digital Research Alliance of Canada (alliancecan.ca), and the National Key R & D Program of China","doi-asserted-by":"publisher","award":["2024YFF0619800"],"award-info":[{"award-number":["2024YFF0619800"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cogn. Commun. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tccn.2026.3706084","type":"journal-article","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T19:57:51Z","timestamp":1782158271000},"page":"9687-9701","source":"Crossref","is-referenced-by-count":0,"title":["DREAM: Disentangled RoI Attention Map for Privacy-Aware Edge Inference"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3900-2607","authenticated-orcid":false,"given":"Manyou","family":"Ma","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Shenzhen Technology University, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3821-4365","authenticated-orcid":false,"given":"Vincent W. S.","family":"Wong","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4077-433X","authenticated-orcid":false,"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6420-4884","authenticated-orcid":false,"given":"Robert","family":"Schober","sequence":"additional","affiliation":[{"name":"Institute for Digital Communications, Friedrich-Alexander University of Erlangen–Nuremberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3126087"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3364990"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2919300"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3071210"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3406381"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3369170"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053216"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747068"},{"issue":"11","key":"ref9","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"4","author":"Rivest","year":"1978","journal-title":"Found. Secure Comput."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00559"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1412"},{"key":"ref12","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kool"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref14","first-page":"1779","article-title":"CLUB: A contrastive log-ratio upper bound of mutual information","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Cheng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5555\/2969033.2969125"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2024.3516819"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3022358"},{"key":"ref18","first-page":"1","article-title":"CrypTen: Secure multi-party computation meets machine learning","volume-title":"Proc. Conf. Neural Inf. Process. Syst. (NeurIPS)","volume":"34","author":"Knott"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10436996"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2024.3409559"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3286711"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2765500"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10436928"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2991416"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3262112"},{"key":"ref28","first-page":"1","article-title":"Isolating sources of disentanglement in variational autoencoders","volume-title":"Proc. Conf. Neural Inf. Process. Syst. (NeurIPS)","author":"Chen"},{"key":"ref29","first-page":"1","article-title":"Disentangling by factorising","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Kim"},{"key":"ref30","article-title":"Privacy-preserving semantic communications via multi-task learning and adversarial perturbations","author":"Sagduyu","year":"2025","journal-title":"arXiv:2512.24452"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2025.3526601"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2023.3317320"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24574-4_28"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17120"},{"key":"ref35","first-page":"1","article-title":"Deep variational information bottleneck","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Alemi"},{"key":"ref36","first-page":"1","article-title":"Auto-encoding variational Bayes","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kingma"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16449-1_71"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-07711-7"}],"container-title":["IEEE Transactions on Cognitive Communications and Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687307\/11304002\/11574696.pdf?arnumber=11574696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T20:06:15Z","timestamp":1783973175000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11574696\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tccn.2026.3706084","relation":{},"ISSN":["2332-7731","2372-2045"],"issn-type":[{"value":"2332-7731","type":"electronic"},{"value":"2372-2045","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}