{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:53:10Z","timestamp":1745038390752,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"U.S. Army Research Office","doi-asserted-by":"publisher","award":["W911NF-23-1-0343"],"award-info":[{"award-number":["W911NF-23-1-0343"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARO Early Career Award","award":["W911NF-21-1-0242"],"award-info":[{"award-number":["W911NF-21-1-0242"]}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-NA0003921"],"award-info":[{"award-number":["DE-NA0003921"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2246213","DMS-2134248","ECCS-2037304"],"award-info":[{"award-number":["CCF-2246213","DMS-2134248","ECCS-2037304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF CAREER Award","award":["CCF-2236829"],"award-info":[{"award-number":["CCF-2236829"]}]},{"name":"Stanford Precourt Institute"},{"name":"ACCESS\u2013AI Chip Center for Emerging Smart Systems through InnoHK, Hong Kong, SAR"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/jsait.2023.3312233","type":"journal-article","created":{"date-parts":[[2023,9,8]],"date-time":"2023-09-08T17:37:26Z","timestamp":1694194646000},"page":"405-419","source":"Crossref","is-referenced-by-count":3,"title":["Securely Aggregated Coded Matrix Inversion"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-1467","authenticated-orcid":false,"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0870-9992","authenticated-orcid":false,"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2531-9670","authenticated-orcid":false,"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA"}]}],"member":"263","reference":[{"key":"ref13","article-title":"CodedPaddedFL and CodedSecAgg: Straggler mitigation and secure aggregation in federated learning","author":"schlegel","year":"2021","journal-title":"arXiv 2112 08909"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834802"},{"key":"ref14","article-title":"Coding for straggler mitigation in federated learning","author":"kumar","year":"2021","journal-title":"arXiv 2109 15226"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1080\/02331930802355234"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps45667.2019.9024521"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541436"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849507"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606866"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850102"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3137266"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3085676"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"ref43","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"blakley","year":"1899","journal-title":"International Workshop on Managing Requirements Knowledge (MARK"},{"article-title":"Approximate Gaussian elimination","year":"2017","author":"kyng","key":"ref49"},{"key":"ref8","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton49937.2022.9929386"},{"key":"ref4","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834356"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref40","article-title":"Sketch and project: Randomized iterative methods for linear systems and inverting matrices","author":"gower","year":"2016","journal-title":"arXiv 1612 06013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2307\/2004623"},{"key":"ref34","article-title":"New bounds for matrix multiplication: From alpha to omega","author":"williams","year":"2023","journal-title":"arXiv 2307 07970"},{"journal-title":"An Introduction to the Conjugate Gradient Method Without the Agonizing Pain","year":"1994","author":"shewchuk","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"journal-title":"Theory of Information and Coding","year":"2001","author":"mceliece","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2307\/2975191"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1080\/01621459.1959.11683595","article-title":"Matrix inversion, its interest and application in analysis of data","volume":"54","author":"greenberg","year":"1959","journal-title":"J Amer Stat Assoc"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919966"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174440"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102956"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref20","article-title":"Federated optimization: Distributed machine learning for on-device intelligence","author":"kone?n?","year":"2016","journal-title":"arXiv 1610 02527"},{"key":"ref22","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","first-page":"709","article-title":"Coded distributed computing for inverse problems","volume":"30","author":"yang","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3190859"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834535"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10153947\/10243572-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153947\/10243572.pdf?arnumber=10243572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T20:06:55Z","timestamp":1730059615000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10243572\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3312233","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2023]]}}}