{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T21:54:13Z","timestamp":1772142853784,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2021R1A2C2014504 (10%)"],"award-info":[{"award-number":["2021R1A2C2014504 (10%)"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2022R1C1C1005749 (15%)"],"award-info":[{"award-number":["2022R1C1C1005749 (15%)"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT (MSIT), Convergence Security Core Talent Training Business","award":["2021-0-01059 (40%)"],"award-info":[{"award-number":["2021-0-01059 (40%)"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT (MSIT), Convergence Security Core Talent Training Business","award":["2021-0-00106 (10%)"],"award-info":[{"award-number":["2021-0-00106 (10%)"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT (MSIT), Convergence Security Core Talent Training Business","award":["2021-0-02068 (10%)"],"award-info":[{"award-number":["2021-0-02068 (10%)"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT (MSIT), Convergence Security Core Talent Training Business","award":["2022-0-01200 (15%)"],"award-info":[{"award-number":["2022-0-01200 (15%)"]}]},{"name":"INMAC"},{"name":"HANWHA SYSTEMS"},{"DOI":"10.13039\/501100002462","name":"Chungnam National University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002462","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BK21 FOUR Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tifs.2024.3377929","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T18:56:35Z","timestamp":1710788195000},"page":"4344-4357","source":"Crossref","is-referenced-by-count":5,"title":["Group-Wise Verifiable Coded Computing Under Byzantine Attacks and Stragglers"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0270-2781","authenticated-orcid":false,"given":"Sangwoo","family":"Hong","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Communications and Machine Learning Laboratory, Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2802-2143","authenticated-orcid":false,"given":"Heecheol","family":"Yang","sequence":"additional","affiliation":[{"name":"Distributed Networks and Computing Laboratory, Division of Computer Convergence, Chungnam National University, Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngseok","family":"Yoon","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California at Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6804-980X","authenticated-orcid":false,"given":"Jungwoo","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Communications and Machine Learning Laboratory, Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advwatres.2011.04.013"},{"key":"ref3","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","volume":"89","author":"Yu"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102956"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989337"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142364"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00067"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834447"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103005"},{"key":"ref11","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref14","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. (NIPS)","author":"Yu"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref17","first-page":"1","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Dutta"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref20","first-page":"5937","article-title":"Dual entangled polynomial code: Three-dimensional coding for distributed matrix multiplication","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Soto"},{"key":"ref21","first-page":"840","article-title":"Sageflow: Robust federated learning against both stragglers and adversaries","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Park"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989254"},{"key":"ref23","first-page":"842","article-title":"Probabilistic machines can use less running time","volume-title":"Proc. IFIP Congr.","volume":"839","author":"Freivalds"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849371"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2592042"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031590"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611422"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2023.3326055"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref31","first-page":"4319","article-title":"Chebyshev polynomial codes: Task entanglement-based coding for distributed matrix multiplication","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","volume":"139","author":"Hong"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776549_0007"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/08073408x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(86)90001-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS49365.2020.9213028"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143199"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/10319981\/10473190.pdf?arnumber=10473190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T17:23:13Z","timestamp":1715361793000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10473190\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3377929","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}