{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:51:53Z","timestamp":1753440713732,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"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%)","2022R1C1C1005749(30%)"],"award-info":[{"award-number":["2021R1A2C2014504(10%)","2022R1C1C1005749(30%)"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute of Information & communications Technology Planning & Evaluation","award":["2021-0-00180(30%)","2021-0-00106(20%)","2021-0-02068(10%)"],"award-info":[{"award-number":["2021-0-00180(30%)","2021-0-00106(20%)","2021-0-02068(10%)"]}]},{"name":"Ministry of Science and ICT (MSIT), INMAC, and BK21-plus"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tcomm.2023.3236385","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T21:20:34Z","timestamp":1673558434000},"page":"1579-1594","source":"Crossref","is-referenced-by-count":5,"title":["Straggler-Exploiting Fully Private Distributed Matrix Multiplication With Chebyshev Polynomials"],"prefix":"10.1109","volume":"71","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, Communications and Machine Learning Laboratory, Seoul National University, Seoul, South Korea"}],"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.1145\/2408776.2408794"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2592042"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. 32th Annu. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3138855"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref15","article-title":"Bivariate polynomial coding for efficient distributed matrix multiplication","author":"Hasircioglu","year":"2020","journal-title":"arXiv:2001.07227"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031590"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref18","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Yu"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143199"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2022.3180941"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2833050"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013152"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3037744"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref33","first-page":"4319","article-title":"Chebyshev polynomial codes: Task entanglement-based coding for distributed matrix multiplication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hong"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/2.1.241"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174440"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611422"},{"key":"ref38","article-title":"Adaptive verifiable coded computing: Towards fast, secure and private distributed machine learning","author":"Tang","year":"2021","journal-title":"arXiv:2107.12958"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.010"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10073971\/10015804.pdf?arnumber=10015804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T06:57:32Z","timestamp":1707807452000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10015804\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":39,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2023.3236385","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}