{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T06:43:35Z","timestamp":1765089815787,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1731384","CCF-1907053"],"award-info":[{"award-number":["CNS-1731384","CCF-1907053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2057"],"award-info":[{"award-number":["N00014-18-1-2057"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-19-1-0344"],"award-info":[{"award-number":["W911NF-19-1-0344"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/jsait.2021.3052934","type":"journal-article","created":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T23:03:19Z","timestamp":1611356599000},"page":"306-316","source":"Crossref","is-referenced-by-count":37,"title":["GCSA Codes With Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6200-2368","authenticated-orcid":false,"given":"Zhen","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8329-9911","authenticated-orcid":false,"given":"Zhuqing","family":"Jia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3339-3085","authenticated-orcid":false,"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2038-2977","authenticated-orcid":false,"given":"Syed Ali","family":"Jafar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"X-secure T-private information retrieval from MDS coded storage with byzantine and unresponsive servers","year":"2019","author":"jia","key":"ref39"},{"journal-title":"On the asymptotic capacity of X-secure T-private information retrieval with graph based replicated storage","year":"2019","author":"jia","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262858"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2948845"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication","year":"2017","author":"yu","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref10","first-page":"2100","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"journal-title":"Cross-subspace alignment codes for coded distributed batch computation","year":"2019","author":"jia","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"journal-title":"CodedSketch A coding scheme for distributed computation of approximated matrix multiplications","year":"2018","author":"jahani-nezhad","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"journal-title":"Fundamental limits of coded linear transform","year":"2018","author":"wang","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"journal-title":"Coded sparse matrix multiplication","year":"2018","author":"wang","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"journal-title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication","year":"2018","author":"dutta","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"journal-title":"Lagrange coded computing Optimal design for resiliency security and privacy","year":"2018","author":"yu","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/280\/04619"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(89)90302-6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613446"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"journal-title":"Secure coded multi-party computation for massive matrix operations","year":"2019","author":"nodehi","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CNS48642.2020.9162296"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"2632","DOI":"10.1109\/TCOMM.2015.2434378","article-title":"Secure degrees of freedom of wireless X networks using artificial noise alignment","volume":"63","author":"zhao","year":"2015","journal-title":"IEEE Trans Commun"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9333639-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09333639.pdf?arnumber=9333639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T20:15:19Z","timestamp":1623701719000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9333639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3052934","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}