{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:32:43Z","timestamp":1774679563169,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 1817635"],"award-info":[{"award-number":["CCF 1817635"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS 1801630"],"award-info":[{"award-number":["CNS 1801630"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARL","award":["W911NF-17-1-0032"],"award-info":[{"award-number":["W911NF-17-1-0032"]}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["DSTO-1677"],"award-info":[{"award-number":["DSTO-1677"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Department of Telecommunications, Government of India","award":["DOTC-0001"],"award-info":[{"award-number":["DOTC-0001"]}]},{"DOI":"10.13039\/100011993","name":"Robert Bosch Center for Cyber-Physical Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011993","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007780","name":"Centre for Networked Intelligence (a Cisco CSR initiative) of the Indian Institute of Science, Bangalore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/tcomm.2020.2988506","type":"journal-article","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T20:05:16Z","timestamp":1587153916000},"page":"4609-4619","source":"Crossref","is-referenced-by-count":44,"title":["Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4421-1024","authenticated-orcid":false,"given":"Rawad","family":"Bitar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3757-904X","authenticated-orcid":false,"given":"Parimal","family":"Parag","sequence":"additional","affiliation":[]},{"given":"Salim","family":"El Rouayheb","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849245"},{"key":"ref38","article-title":"CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning","author":"so","year":"2019","journal-title":"arXiv 1902 00641"},{"key":"ref33","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"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849446"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref37","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref35","article-title":"Uplink-downlink tradeoff in secure distributed matrix multiplication","author":"kakar","year":"2019","journal-title":"arXiv 1910 13849"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755695"},{"key":"ref40","first-page":"1","article-title":"Privacy preserving multi-party machine learning with homomorphic encryption","author":"takabi","year":"2016","journal-title":"Proc 29th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541528"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2723019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616144"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref18","article-title":"Cross subspace alignment codes for coded distributed batch computation","author":"jia","year":"2019","journal-title":"arXiv 1909 13873"},{"key":"ref19","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref4","year":"2017","journal-title":"Folding at Home"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref3","year":"2017","journal-title":"Seti at Home"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref7","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc 29th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref2","article-title":"Minimizing latency for secure coded computing using secret sharing via staircase codes","author":"bitar","year":"2018","journal-title":"arXiv 1802 02640"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref20","article-title":"Revisiting distributed synchronous SGD","author":"chen","year":"2016","journal-title":"arXiv 1604 00981"},{"key":"ref45","year":"2018","journal-title":"Amazon Web Services"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483236"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284026"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt066"},{"key":"ref24","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"Proc 29th Conf Neural Inf Process Syst (NIPS)"},{"key":"ref41","first-page":"669","article-title":"Secure multiple linear regression based on homomorphic encryption","volume":"27","author":"hall","year":"2011","journal-title":"J Offic Statist"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282699"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127580"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref43","article-title":"Private learning on networks: Part II","author":"gade","year":"2017","journal-title":"arXiv 1703 09185"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/9166799\/9069916-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9166799\/09069916.pdf?arnumber=9069916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:48:38Z","timestamp":1651067318000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9069916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.2988506","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}