{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:33:14Z","timestamp":1778347994882,"version":"3.51.4"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100025294","name":"Taighde \u00c9ireann \u2013 Research Ireland","doi-asserted-by":"crossref","award":["18\/CRT\/6222"],"award-info":[{"award-number":["18\/CRT\/6222"]}],"id":[{"id":"10.13039\/501100025294","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100003973","name":"MSCA","doi-asserted-by":"publisher","award":["101182933"],"award-info":[{"award-number":["101182933"]}],"id":[{"id":"10.13039\/100003973","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Internet Comput."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/mic.2026.3656638","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T21:09:52Z","timestamp":1769029792000},"page":"59-70","source":"Crossref","is-referenced-by-count":3,"title":["Toward Verifiable Federated Unlearning: Framework, Challenges, and the Road Ahead"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1933-7191","authenticated-orcid":false,"given":"Thanh Linh","family":"Nguyen","sequence":"first","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College Dublin, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5739-5590","authenticated-orcid":false,"given":"Marcela Tuler De","family":"Oliveira","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, GA, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9965-915X","authenticated-orcid":false,"given":"An","family":"Braeken","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Brussel, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4173-031X","authenticated-orcid":false,"given":"Aaron Yi","family":"Ding","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, GA, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9485-9216","authenticated-orcid":false,"given":"Quoc-Viet","family":"Pham","sequence":"additional","affiliation":[{"name":"School of Computer Science and Statistics, Trinity College Dublin, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2015.35"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2025.3530988"},{"key":"ref5","first-page":"267","article-title":"The secret sharer: Evaluating and testing unintended memorization in neural networks","volume-title":"Proc. 28th USENIX Secur. Symp.","author":"Carlini","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3233\/faia250917"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3478334"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3679014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2026.3668538"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2024.3382321"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714740"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3749987"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3335741.3335750"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2013.47"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/comst.2025.3561657"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2487726.2488368"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3718082"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2025.3553709"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr52734.2025.02855"}],"container-title":["IEEE Internet Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4236\/11449199\/11359714.pdf?arnumber=11359714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T20:07:52Z","timestamp":1774296472000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":20,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/mic.2026.3656638","relation":{},"ISSN":["1089-7801","1941-0131"],"issn-type":[{"value":"1089-7801","type":"print"},{"value":"1941-0131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}