{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:34:46Z","timestamp":1753601686991,"version":"3.37.3"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Technical University of Munich\u2014Institute for Advanced Studies"},{"DOI":"10.13039\/100011102","name":"German Excellence Initiative and European Union Seventh Framework Programme","doi-asserted-by":"publisher","award":["291763"],"award-info":[{"award-number":["291763"]}],"id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"DFG (German Research Foundation) Project","doi-asserted-by":"publisher","award":["WA 3907\/7-1"],"award-info":[{"award-number":["WA 3907\/7-1"]}],"id":[{"id":"10.13039\/501100001659","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":[[2022,6]]},"DOI":"10.1109\/jsait.2022.3180941","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T20:16:38Z","timestamp":1654805798000},"page":"275-285","source":"Crossref","is-referenced-by-count":15,"title":["Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2550-4662","authenticated-orcid":false,"given":"Christoph","family":"Hofmeister","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4421-1024","authenticated-orcid":false,"given":"Rawad","family":"Bitar","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5341-9954","authenticated-orcid":false,"given":"Marvin","family":"Xhemrishi","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-1947","authenticated-orcid":false,"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Cross subspace alignment codes for coded distributed batch matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv 1909 13873"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref33","first-page":"1","article-title":"Rateless codes for private distributed matrix-matrix multiplication","author":"bitar","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory Appl (ISITA)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1117\/12.2519768"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref37","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":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-020-01887-y"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143199"},{"journal-title":"Elements of Information Theory","year":"1999","author":"cover","key":"ref60"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"},{"key":"ref29","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 (AISTATS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","first-page":"1","article-title":"Secure private and adaptive matrix multiplication beyond the singleton bound","author":"hofmeister","year":"2021","journal-title":"Proc 12th Int Workshop Coding Cryptogr"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103822"},{"key":"ref22","article-title":"Efficient replication for straggler mitigation in distributed computing","author":"behrouzi-far","year":"2020","journal-title":"arXiv 2006 02318"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174030"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1561\/0100000103","article-title":"Coded computing","volume":"17","author":"li","year":"2020","journal-title":"Foundations and Trends in Communication and information Theory"},{"key":"ref25","article-title":"Bivariate polynomial coding for exploiting stragglers in heterogeneous coded computing systems","author":"hasircioglu","year":"2020","journal-title":"arXiv 2001 07227"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174266"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126474"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","article-title":"Probabilistic algorithms for sparse polynomials","author":"zippel","year":"1979","journal-title":"Symbolic and Algebraic Computation"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"},{"key":"ref54","first-page":"57","article-title":"Fast probabilistic algorithms","author":"freivalds","year":"1979","journal-title":"Mathematical Foundations of Computer Science"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989337"},{"key":"ref52","article-title":"Verifiable coded computing: Towards fast, secure and private distributed machine learning","author":"tang","year":"2021","journal-title":"arXiv 2107 12958"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref40","article-title":"Secure distributed matrix computation with discrete fourier transform","author":"mital","year":"2020","journal-title":"arXiv 2007 03972"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/e22050544"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref14","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref15","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00013"},{"key":"ref4","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","author":"ananthanarayanan","year":"2013","journal-title":"Proc 10th USENIX Symp Netw Syst Design Implement (NSDI 13)"},{"key":"ref3","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2289382"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517801"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437719"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518044"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989254"},{"key":"ref48","first-page":"1","article-title":"Talking reliably, secretly, and efficiently: A ‘complete’ characterization","author":"zhang","year":"2015","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916590"},{"key":"ref42","article-title":"Private retrieval, computing and learning: Recent progress and future challenges","author":"ulukus","year":"2021","journal-title":"arXiv 2108 00026"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174509"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013340"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3055341"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9953899\/09792194.pdf?arnumber=9792194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:44:23Z","timestamp":1670874263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9792194\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":60,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2022.3180941","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}