{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:19Z","timestamp":1773377659923,"version":"3.50.1"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174230","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"227-232","source":"Crossref","is-referenced-by-count":8,"title":["GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Zhen","family":"Chen","sequence":"first","affiliation":[{"name":"University of California Irvine,Center for Pervasive Communications and Computing (CPCC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuqing","family":"Jia","sequence":"additional","affiliation":[{"name":"University of California Irvine,Center for Pervasive Communications and Computing (CPCC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California Irvine,Center for Pervasive Communications and Computing (CPCC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[{"name":"University of California Irvine,Center for Pervasive Communications and Computing (CPCC)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Cross-subspace alignment codes for coded distributed batch computation","author":"jia","year":"2019","journal-title":"ArXiv I909 I3873"},{"key":"ref38","article-title":"X-secure T-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers","author":"jia","year":"2019","journal-title":"arXiv 1908 10854"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref37","article-title":"On the Asymptotic Capacity of X-Secure T- Private Information Retrieval with Graph Based Replicated Storage","author":"jia","year":"2019","journal-title":"ArXiv I904 05906"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262858"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2948845"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref40","article-title":"Secure coded multi-party computation for massive matrix operations","author":"nodehi","year":"2019","journal-title":"arXiv 1908 04255"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref12","article-title":"Codedsketch: A coding scheme for distributed computation of approximated matrix multiplications","author":"jahani-nezhad","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref15","article-title":"Fundamental limits of coded linear transform","author":"wang","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref17","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref4","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":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref6","article-title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","author":"yu","year":"2018","journal-title":"ArXiv I806 00939"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref2","article-title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","author":"yu","year":"2017"},{"key":"ref9","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1994.1021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/280\/04619"},{"key":"ref48","article-title":"GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication","author":"chen","year":"2020","journal-title":"ArXiv 2002 07750"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref42","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 Transactions on Communications"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613446"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174230.pdf?arnumber=9174230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:47Z","timestamp":1773347687000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174230\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174230","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}