{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T14:57:18Z","timestamp":1785596238505,"version":"3.56.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61941106"],"award-info":[{"award-number":["61941106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871331"],"award-info":[{"award-number":["61871331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1109\/tcomm.2021.3107942","type":"journal-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T20:19:55Z","timestamp":1630009195000},"page":"7673-7690","source":"Crossref","is-referenced-by-count":25,"title":["Improved Constructions for Secure Multi-Party Batch Matrix Multiplication"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8088-0076","authenticated-orcid":false,"given":"Jinbao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0746-9819","authenticated-orcid":false,"given":"Qifa","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7938-7812","authenticated-orcid":false,"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref31","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc 30th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107942"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3044727"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2434378"},{"key":"ref34","first-page":"10","article-title":"Spark: Cluster computing with working sets","volume":"10","author":"zaharia","year":"2010","journal-title":"Proc 2nd USENIX HotCloud"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0215043"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref14","article-title":"Uplink-downlink tradeoff in secure distributed matrix multiplication","author":"kakar","year":"2019","journal-title":"arXiv 1910 13849"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref18","article-title":"Secure distributed matrix computation with discrete Fourier transform","author":"mital","year":"2020","journal-title":"arXiv 2007 03972"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613446"},{"key":"ref28","first-page":"1","article-title":"Multi-task learning for straggler avoiding predictive job scheduling","volume":"17","author":"yadwadkar","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3052934"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref5","first-page":"137","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc USENIX Symp on Operating System Design and Implementation"},{"key":"ref8","first-page":"2100","author":"dutta","year":"2016","journal-title":"Proc 29th Adv Neural Inf Process Syst (NIPS)"},{"key":"ref7","article-title":"A unified coded deep neural network training strategy based on generalized PolyDot codes for matrix multiplication","author":"dutta","year":"2018","journal-title":"arXiv 1811 10751"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref22","author":"sedoglavic","year":"2021","journal-title":"Faster Matrix Multiplication Algorithms"},{"key":"ref21","author":"pordavi","year":"2003","journal-title":"Recent Research on Pure and Applied Algebra"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9618670\/09523544.pdf?arnumber=9523544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:41Z","timestamp":1652194121000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9523544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":37,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2021.3107942","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11]]}}}