{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:37:44Z","timestamp":1790750264016,"version":"4.1.0"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001117C0053"],"award-info":[{"award-number":["HR001117C0053"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARO award","award":["W911NF1810400"],"award-info":[{"award-number":["W911NF1810400"]}]},{"name":"NSF grants","award":["CCF-1703575"],"award-info":[{"award-number":["CCF-1703575"]}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-16-1-2189"],"award-info":[{"award-number":["N00014-16-1-2189"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["CCF-1763673"],"award-info":[{"award-number":["CCF-1763673"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tcomm.2020.3032196","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T13:41:30Z","timestamp":1603287690000},"page":"59-72","source":"Crossref","is-referenced-by-count":33,"title":["Coded Computing for Resilient, Secure, and Privacy-Preserving Distributed Matrix Multiplication"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2034-5941","authenticated-orcid":false,"given":"Qian","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"A non-commutative algorithm for multiplying $5\\times5$\n matrices using 99 multiplications","author":"sedoglavic","year":"2017","journal-title":"arXiv 1707 06860"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-05-00506-0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.52"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.27"},{"key":"ref37","volume":"315","author":"b\u00fcrgisser","year":"2013","journal-title":"Algebraic Complexity Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.012"},{"key":"ref34","article-title":"On the complexity of matrix multiplication","author":"stothers","year":"2010"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849371"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849811"},{"key":"ref63","article-title":"InfoCommit: Information-theoretic polynomial commitment and verification","author":"sahraei","year":"2020","journal-title":"arXiv 2002 00559"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"ref2","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume":"89","author":"yu","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref20","article-title":"Cross subspace alignment codes for coded distributed batch computation","author":"jia","year":"2019","journal-title":"arXiv 1909 13873"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref21","first-page":"1","article-title":"Generalized cross subspace alignment codes for coded distributed batch matrix multiplication","author":"jia","year":"2019","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0120004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.34"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"ref50","first-page":"1","article-title":"Degree tables for secure distributed matrix multiplication","author":"d\u2019oliveira","year":"2019","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849245"},{"key":"ref56","article-title":"Fast matrix multiplication. No. 5 in graduate surveys","author":"bl\u00e4ser","year":"2013"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref54","article-title":"Coded FFT and its communication overhead","author":"jeong","year":"2018","journal-title":"arXiv 1805 09891"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref10","first-page":"4406","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref40","article-title":"A non-commutative algorithm for multiplying ($7\\times7$\n) matrices using 250 multiplications","author":"sedoglavic","year":"2017","journal-title":"arXiv 1712 07935"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849252"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref18","article-title":"Private and secure distributed matrix multiplication with flexible communication load","author":"aliasgari","year":"2019","journal-title":"arXiv 1909 00407"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613446"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/357369.357371"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SKG.2010.19"},{"key":"ref8","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2015","journal-title":"arXiv 1512 02673"},{"key":"ref7","article-title":"CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning","author":"so","year":"2019","journal-title":"arXiv 1902 00641"},{"key":"ref49","article-title":"Uplink-downlink tradeoff in secure distributed matrix multiplication","author":"kakar","year":"2019","journal-title":"arXiv 1910 13849"},{"key":"ref9","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761275"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref48","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv 1908 06957"},{"key":"ref47","article-title":"Secure coded multi-party computation for massive matrix operations","author":"nodehi","year":"2019","journal-title":"arXiv 1908 04255"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref41","author":"le gall","year":"2019","journal-title":"Complexity of Matrix Multiplication and Bilinear Problems"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849446"},{"key":"ref43","article-title":"Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"2018","journal-title":"arXiv 1810 13006"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9325108\/09229375.pdf?arnumber=9229375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T10:48:51Z","timestamp":1652179731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9229375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":63,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3032196","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}