{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:11:33Z","timestamp":1772907093391,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities Under","award":["NS2024055"],"award-info":[{"award-number":["NS2024055"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62061146002"],"award-info":[{"award-number":["62061146002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation, Singapore and Infocomm Media Development Authority"},{"name":"Future Communications Research & Development Programme","award":["FCP-NTU-RG-2022-010"],"award-info":[{"award-number":["FCP-NTU-RG-2022-010"]}]},{"name":"Future Communications Research & Development Programme","award":["FCP-ASTAR-TG-2022-003"],"award-info":[{"award-number":["FCP-ASTAR-TG-2022-003"]}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["RG87\/22"],"award-info":[{"award-number":["RG87\/22"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["RG24\/24"],"award-info":[{"award-number":["RG24\/24"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NTU Centre for Computational Technologies in Finance"},{"name":"RIE2025 Industry Alignment Fund-Industry Collaboration Projects","award":["I2301E0026"],"award-info":[{"award-number":["I2301E0026"]}]},{"name":"Alibaba Group and NTU Singapore through Alibaba-NTU Global e-Sustainability CorpLab"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tetc.2025.3562192","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T13:06:33Z","timestamp":1745499993000},"page":"1030-1042","source":"Crossref","is-referenced-by-count":2,"title":["Approximated Coded Computing: Towards Fast, Private and Secure Distributed Machine Learning"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0220-0538","authenticated-orcid":false,"given":"Houming","family":"Qiu","sequence":"first","affiliation":[{"name":"School of Software and IoT Engineering, Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6784-5583","authenticated-orcid":false,"given":"Kun","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4299-3456","authenticated-orcid":false,"given":"Nguyen Cong","family":"Luong","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7442-7416","authenticated-orcid":false,"given":"Dusit","family":"Niyato","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-54528-3_20"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIA.2022.3188749"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3098962"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3282907"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2020.2986544"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00324"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3244243"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3202529"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3446641"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCS57501.2023.10151385"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3418449"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206830"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3151434"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00067"},{"key":"ref17","first-page":"245","article-title":"Entangled polynomial codes for secure, private, and batch distributed matrix multiplication: Breaking the \u201ccubic\u201d barrier","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Yu"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3214089"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref24","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177609"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3105365"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/JSAIT.2023.3308768","article-title":"Distributed matrix computations with low-weight encodings","volume":"4","author":"Das","year":"2023","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"1680","DOI":"10.1109\/TIFS.2023.3249565","article-title":"Information-theoretically private matrix multiplication from MDS-coded storage","volume":"18","author":"Zhu","year":"2023","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"2722","DOI":"10.1109\/TIFS.2020.2972166","article-title":"Private and secure distributed matrix multiplication with flexible communication load","volume":"15","author":"Aliasgari","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref32","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/TIFS.2022.3147638","article-title":"Private and secure distributed matrix multiplication schemes for replicated or MDS-coded servers","volume":"17","author":"Li","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref33","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1109\/TIFS.2023.3236788","article-title":"Jamming and eavesdropping defense scheme based on deep reinforcement learning in autonomous vehicle networks","volume":"18","author":"Yao","year":"2023","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3158663"},{"key":"ref35","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TIFS.2024.3524160","article-title":"Privacy-preserving coded schemes for multi-server federated learning with straggling links","volume":"20","author":"Liang","year":"2025","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3142678"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621440"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3165400"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2024.3391317"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177711"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2013.01.004"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0093-y"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2021.3083216"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3272567"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6245516\/11159571\/10976493.pdf?arnumber=10976493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:31:16Z","timestamp":1757698276000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976493\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2025.3562192","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"value":"2168-6750","type":"electronic"},{"value":"2376-4562","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}