{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:42Z","timestamp":1773377682058,"version":"3.50.1"},"reference-count":24,"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\/100010663","name":"European Research Council (ERC)","doi-asserted-by":"publisher","award":["677854"],"award-info":[{"award-number":["677854"]}],"id":[{"id":"10.13039\/100010663","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.9517739","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1853-1858","source":"Crossref","is-referenced-by-count":11,"title":["Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes"],"prefix":"10.1109","author":[{"given":"Burak","family":"Hasircio\u011flu","sequence":"first","affiliation":[{"name":"Imperial College,London,UK"}]},{"given":"Jes\u00fas","family":"G\u00f3mez-Vilardeb\u00f3","sequence":"additional","affiliation":[{"name":"Centre Tecnològic de Telecomunicacions de Catalunya (CTTC\/CERCA),Barcelona,Spain"}]},{"given":"Deniz","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[{"name":"Imperial College,London,UK"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Bivariate hermitian polynomial coding for efficient distributed matrix multiplication","author":"hasircioglu","year":"0","journal-title":"IEEE Global Communications Conference (Globecom)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref12","article-title":"Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"18","journal-title":"ArXiv Preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref15","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref16","article-title":"Uplink-downlink tradeoff in secure distributed matrix multiplication","author":"kakar","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref17","article-title":"Secure distributed matrix computation with discrete fourier transform","author":"mital","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Rateless codes for private distributed matrix-matrix multiplication","author":"bitar","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref5","article-title":"Cross subspace alignment codes for coded distributed batch computation","author":"jia","year":"2019","journal-title":"ArXiv"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/e22050544"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"key":"ref2","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174542"},{"key":"ref20","article-title":"Bivariate polynomial coding for exploiting stragglers in heterogeneous coded computing systems","author":"hasircioglu","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref22","author":"fontein","year":"2009","journal-title":"The hasse derivative"},{"key":"ref21","article-title":"Linear algebra","author":"hoffman","year":"1971","journal-title":"Englewood Cliffs New Jersey 07632"},{"key":"ref24","author":"liesen","year":"0","journal-title":"Linear algebra ser Springer undergraduate mathematics series"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"}],"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\/09517739.pdf?arnumber=9517739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:51Z","timestamp":1773347691000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517739","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}