{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:52Z","timestamp":1773378112520,"version":"3.50.1"},"reference-count":49,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency (DARPA)","doi-asserted-by":"publisher","award":["HR001117C0053,FA8750-19-2-1005"],"award-info":[{"award-number":["HR001117C0053,FA8750-19-2-1005"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF1810400"],"award-info":[{"award-number":["W911NF1810400"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1763348,CCF-1909771,CCF-1941633,CCF-1703575,CCF-1763673"],"award-info":[{"award-number":["CCF-1763348,CCF-1909771,CCF-1941633,CCF-1703575,CCF-1763673"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-16-1-2189"],"award-info":[{"award-number":["N00014-16-1-2189"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518044","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1206-1211","source":"Crossref","is-referenced-by-count":2,"title":["List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier"],"prefix":"10.1109","author":[{"given":"Mahdi","family":"Soleymani","sequence":"first","affiliation":[{"name":"University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,48104"}]},{"given":"Ramy E.","family":"Ali","sequence":"additional","affiliation":[{"name":"University of Southern California,Department of Electrical Engineering,Los Angeles,CA,USA,90089"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,48104"}]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[{"name":"University of Southern California,Department of Electrical Engineering,Los Angeles,CA,USA,90089"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0578-y"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.554"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref30","author":"elias","year":"1957","journal-title":"List decoding for noisy channels"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214429"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/2047-2501-2-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3055341"},{"key":"ref29","first-page":"60","article-title":"Big data: the management revolution","volume":"90","author":"mcafee","year":"2012","journal-title":"Harvard Business Review"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref21","article-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings","author":"ramamoorthy","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174512"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989254"},{"key":"ref26","article-title":"Analog Lagrange coded computing","author":"soleymani","year":"2021","journal-title":"IEEE Journal on Selected Areas in Information Theory (JSAIT) Special issue on Privacy and Security of Information Systems"},{"key":"ref25","author":"soleymani","year":"2020","journal-title":"Privacy-preserving distributed learning in the analog domain"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref40","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437525"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref18","article-title":"Private and rateless adaptive coded matrix-vector multiplication","author":"bitar","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref19","author":"nodehi","year":"2019","journal-title":"Secure coded multi-party computation for massive matrix operations"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref3","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref5","article-title":"Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning","author":"so","year":"2021","journal-title":"IEEE Journal on Selected Areas in Information Theory (JSAIT) Special issue on Privacy and Security of Information Systems"},{"key":"ref8","article-title":"A scalable approach for privacy-preserving collaborative machine learning","volume":"33","author":"so","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref7","article-title":"CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning","author":"so","year":"2021","journal-title":"IEEE Journal on Selected Areas in Information Theory (JSAIT) Special issue on Privacy and Security of Information Systems"},{"key":"ref49","article-title":"List-decodable coded computing: Breaking the adversarial toleration barrier","author":"soleymani","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref9","article-title":"Berrut approximated coded computing: Straggler resistance beyond polynomial computing","author":"jahani-nezhad","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.2307\/2005828"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.22"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref43","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume":"30","author":"yu","year":"0","journal-title":"Advances in neural information processing systems"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518044.pdf?arnumber=9518044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:21Z","timestamp":1773347781000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518044\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518044","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}