{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:19:08Z","timestamp":1753600748798,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/iwcit50667.2020.9163533","type":"proceedings-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T22:50:12Z","timestamp":1597186212000},"page":"1-6","source":"Crossref","is-referenced-by-count":9,"title":["Coded Secure Multi-Party Computation for Massive Matrices with Adversarial Nodes"],"prefix":"10.1109","author":[{"given":"Seyed Reza Hoseini","family":"Najarkolaei","sequence":"first","affiliation":[]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Aref","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref11","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv preprint arXiv 1908 00310"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761275"},{"key":"ref13","article-title":"Entangled polynomial codes for secure, private, and batch distributed matrix multiplication: Breaking the”cubic”barrier","author":"yu","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref14","article-title":"Gcsa codes with noise alignment for secure coded multi-party batch matrix multiplication","author":"chen","year":"2020","journal-title":"arXiv preprint arXiv 2002 05155"},{"key":"ref15","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv preprint arXiv 1806 00939"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT50667.2020.9163533"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"ref18","first-page":"10","article-title":"A full proof of the bgw protocol for perfectly-secure multiparty computation","volume":"18","author":"asharov","year":"2011","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref8","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"arXiv preprint arXiv 1705 10464"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613446"},{"key":"ref2","article-title":"Secure multi-party computation","volume":"78","author":"goldreich","year":"1998","journal-title":"Manuscript Preliminary Version"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"ref9","article-title":"Private and secure distributed matrix multiplication with flexible communication load","author":"aliasgari","year":"2019","journal-title":"arXiv preprint arXiv 1909 01771"}],"event":{"name":"2020 8th Iran Workshop on Communication and Information Theory (IWCIT)","start":{"date-parts":[[2020,5,26]]},"location":"Tehran, Iran","end":{"date-parts":[[2020,5,28]]}},"container-title":["2020 Iran Workshop on Communication and Information Theory (IWCIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9162008\/9163398\/09163533.pdf?arnumber=9163533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:54:36Z","timestamp":1656453276000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9163533\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iwcit50667.2020.9163533","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}