{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:26:56Z","timestamp":1757780816743},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icc.2019.8761275","type":"proceedings-article","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:16:31Z","timestamp":1563236191000},"page":"1-6","source":"Crossref","is-referenced-by-count":10,"title":["The Need for Alignment in Rate-Efficient Distributed Two-Sided Secure Matrix Computation"],"prefix":"10.1109","author":[{"given":"Seyedhamed","family":"Ebadifar","sequence":"first","affiliation":[]},{"given":"Jaber","family":"Kakar","sequence":"additional","affiliation":[]},{"given":"Aydin","family":"Sezgin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/e19070362"},{"key":"ref12","article-title":"Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"2018","journal-title":"CoRR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"ref14","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/76263.76298"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29737-3_50"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841783"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3098954.3098989"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2013.12"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199705)9:5<345::AID-CPE258>3.0.CO;2-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4655(01)00164-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"}],"event":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","start":{"date-parts":[[2019,5,20]]},"location":"Shanghai, China","end":{"date-parts":[[2019,5,24]]}},"container-title":["ICC 2019 - 2019 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8753818\/8761046\/08761275.pdf?arnumber=8761275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:14:12Z","timestamp":1657854852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8761275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icc.2019.8761275","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}