{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:24:40Z","timestamp":1740101080988,"version":"3.37.3"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF-15-1-0479"],"award-info":[{"award-number":["W911NF-15-1-0479"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-183817,ECCS-2037304,DMS-2134248"],"award-info":[{"award-number":["IIS-183817,ECCS-2037304,DMS-2134248"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,27]]},"DOI":"10.1109\/allerton49937.2022.9929386","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T21:34:30Z","timestamp":1667597670000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Secure Linear MDS Coded Matrix Inversion"],"prefix":"10.1109","author":[{"given":"Neophytos","family":"Charalambides","sequence":"first","affiliation":[{"name":"University of Michigan,EECS Department"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mert","family":"Pilanci","sequence":"additional","affiliation":[{"name":"Stanford University,EE Department"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[{"name":"University of Michigan,EECS Department"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Numerically stable binary coded computations","author":"charalambides","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620554"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","year":"2006","author":"cover","key":"ref31"},{"journal-title":"Notes on the sensitivity of linear systems","year":"0","author":"atkinson","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"journal-title":"Theory of Information and Coding","year":"2001","author":"mceliece","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.2307\/2975191"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref11","article-title":"Lagrange coded computing: Optimal design for re-siliency, security and privacy","author":"yu","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref13","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref15","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541436"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606866"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70087-8_73"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref3","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":"Journal of the American Statistical Association"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"journal-title":"An Introduction to the Conjugate Gradient Method Without the Agonizing Pain","year":"1994","author":"shewchuk","key":"ref29"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"strassen","year":"1969","journal-title":"Numerische Math-ematik"},{"key":"ref8","article-title":"Solving sparse linear systems faster than matrix multiplication","author":"peng","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"ref2","article-title":"Secure Linear MDS Coded Matrix Inversion","author":"charalambides","year":"2022","journal-title":"ArXiv Preprint"},{"key":"ref9","article-title":"A refined laser method and faster matrix multiplication","author":"alman","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref1","article-title":"Straggler Robust Distributed Matrix Inverse Approximation","author":"charalambides","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054153"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3190859"}],"event":{"name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2022,9,27]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2022,9,30]]}},"container-title":["2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9929313\/9929314\/09929386.pdf?arnumber=9929386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T09:01:19Z","timestamp":1728291679000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9929386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/allerton49937.2022.9929386","relation":{},"subject":[],"published":{"date-parts":[[2022,9,27]]}}}