{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:27:17Z","timestamp":1753601237707,"version":"3.37.3"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019186","name":"MIT Portugal","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019186","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,25]]},"DOI":"10.1109\/redundancy52534.2021.9606447","type":"proceedings-article","created":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T20:32:50Z","timestamp":1636662770000},"page":"188-193","source":"Crossref","is-referenced-by-count":14,"title":["Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Roberto Assis","family":"Machado","sequence":"first","affiliation":[]},{"given":"Rafael G. L.","family":"D'Oliveira","sequence":"additional","affiliation":[]},{"given":"Salim El","family":"Rouayheb","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Heinlein","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/ISIT.2017.8006842"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TIT.2018.2871451"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TCOMM.2020.2988506"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/FOCS.2017.28"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1201\/9781315147901"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref11","article-title":"Secure distributed matrix computation with discrete fourier transform","author":"mital","year":"2020","journal-title":"arXiv preprint arXiv 2007 09948"},{"key":"ref12","article-title":"Adaptive private distributed matrix multiplication","author":"bitar","year":"2021","journal-title":"arXiv preprint arXiv 2101 06286"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ISIT45174.2021.9517739"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2020.2975021"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2017.2702660"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref17","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"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref19","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ISIT.2019.8849446"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TIT.2011.2159049"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIFS.2018.2846601"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2010.2054295"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref5","article-title":"Degree tables for secure distributed matrix multiplication","author":"d\u2019oliveira","year":"2019","journal-title":"IEEE Information Theory Workshop 2019 (ITW 2012)"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref8","article-title":"Uplinkdownlink tradeoff in secure distributed matrix multiplication","author":"kakar","year":"2019","journal-title":"ArXiv"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TIFS.2020.2972166"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ACCESS.2019.2908024"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/CNS48642.2020.9162296"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/GLOCOM.2018.8647313"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/BigData.2018.8622429"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ISIT.2018.8437651"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TIT.2017.2756959"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref23","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv preprint arXiv 1908 00310"},{"key":"ref26","article-title":"Improved constructions for secure multiparty batch matrix multiplication","author":"zhu","year":"2021","journal-title":"arXiv preprint arXiv 2103 05767"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIFS.2019.2940895"}],"event":{"name":"2021 XVII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","start":{"date-parts":[[2021,10,25]]},"location":"Moscow, Russian Federation","end":{"date-parts":[[2021,10,29]]}},"container-title":["2021 XVII International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9606438\/9606439\/09606447.pdf?arnumber=9606447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:51:44Z","timestamp":1652201504000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9606447\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,25]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/redundancy52534.2021.9606447","relation":{},"subject":[],"published":{"date-parts":[[2021,10,25]]}}}