{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T18:13:25Z","timestamp":1789668805676,"version":"4.0.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/glocom.2018.8647313","type":"proceedings-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:34:06Z","timestamp":1550774046000},"page":"1-6","source":"Crossref","is-referenced-by-count":124,"title":["On the Capacity of Secure Distributed Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Wei-Ting","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ravi","family":"Tandon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref11","article-title":"On the optimal recovery threshold of coded matrix multiplication","volume":"abs 1801 10292","author":"dutta","year":"2018","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref13","article-title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy","volume":"abs 1806 939","author":"yu","year":"2018","journal-title":"CoRR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref16","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394944"},{"key":"ref3","first-page":"162","article-title":"Mix and match: Secure function evaluation via ciphertexts","author":"jakobsson","year":"2000","journal-title":"Advances in Cryptology"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2013.12"},{"key":"ref5","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2010","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1515\/tmmp-2016-0031"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3098954.3098989"},{"key":"ref2","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party's input and correctness of the result","author":"chaum","year":"1988","journal-title":"Advances in Cryptology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref9","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 I (NIPS)"}],"event":{"name":"GLOBECOM 2018 - 2018 IEEE Global Communications Conference","location":"Abu Dhabi, United Arab Emirates","start":{"date-parts":[[2018,12,9]]},"end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8634808\/8647127\/08647313.pdf?arnumber=8647313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T02:16:36Z","timestamp":1643249796000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8647313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/glocom.2018.8647313","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}