{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:11:31Z","timestamp":1772907091384,"version":"3.50.1"},"reference-count":60,"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":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF\u20131763348"],"award-info":[{"award-number":["CCF\u20131763348"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF\u20131909771"],"award-info":[{"award-number":["CCF\u20131909771"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF\u20131941633"],"award-info":[{"award-number":["CCF\u20131941633"]}],"id":[{"id":"10.13039\/100000001","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.3056377","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T06:30:36Z","timestamp":1612333836000},"page":"283-295","source":"Crossref","is-referenced-by-count":45,"title":["Analog Lagrange Coded Computing"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5495-901X","authenticated-orcid":false,"given":"Mahdi","family":"Soleymani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1992","authenticated-orcid":false,"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref38","article-title":"Towards practical secure computation with floating-point numbers","author":"catrina","year":"2018","journal-title":"Proc 3rd Annu Int Conf Cryptogr Inf Security"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0053"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3335741.3335756"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref37","first-page":"785","article-title":"Secure computation on floating point numbers","author":"aliasgari","year":"2013","journal-title":"Proc 20th Annu Netw Distrib Syst Security Symp (NDSS)"},{"key":"ref36","first-page":"253","article-title":"Taking proof-based verified computation a few steps closer to practicality","author":"setty","year":"0"},{"key":"ref35","article-title":"A scalable approach for privacy-preserving collaborative machine learning","volume":"33","author":"so","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref34","author":"chen","year":"2019","journal-title":"Secure Computation for Machine Learning With SPDZ"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437813"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2925723"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3032196"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919966"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00092"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref26","article-title":"Secure coded multi-party computation for massive matrix operations","author":"nodehi","year":"2021","journal-title":"IEEE Trans Inf Theory"},{"key":"ref25","author":"bitar","year":"2019","journal-title":"Private and rateless adaptive coded matrix-vector multiplication"},{"key":"ref50","article-title":"A cryptographic treatment of the wiretap channel","author":"bellare","year":"2012"},{"key":"ref51","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"blanchard","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618979"},{"key":"ref58","first-page":"5796","article-title":"Improving the privacy and accuracy of ADMM-based distributed algorithms","author":"zhang","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2923959"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TKDE.2006.14","article-title":"Random projection-based multiplicative data perturbation for privacy preserving distributed data mining","volume":"18","author":"liu","year":"2006","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503187"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484263"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"key":"ref40","author":"ramamoorthy","year":"2019","journal-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref16","author":"soleymani","year":"2020","journal-title":"Privacy-preserving distributed learning in the analog domain"},{"key":"ref17","author":"dahl","year":"2018","journal-title":"Private machine learning in TensorFlow using secure computation"},{"key":"ref18","article-title":"Secure evaluation of quantized neural networks","author":"barak","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"key":"ref4","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","first-page":"265","article-title":"TensorFlow: A system for large-scale machine learning","author":"abadi","year":"2016","journal-title":"Proc of USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014145"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2002.1047289"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00551-4_4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174309"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343226"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977918"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9345331-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09345331.pdf?arnumber=9345331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T20:14:43Z","timestamp":1623701683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9345331\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":60,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3056377","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}