{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:56:04Z","timestamp":1756385764067,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437651","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1231-1235","source":"Crossref","is-referenced-by-count":40,"title":["Limited-Sharing Multi-Party Computation for Massive Matrix Operations"],"prefix":"10.1109","author":[{"given":"Hanzaleh Akbari","family":"Nodehi","sequence":"first","affiliation":[]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10879-7_11"},{"journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication","year":"2017","author":"yu","key":"ref11"},{"journal-title":"Limited-sharing multiparty computation for massive matrix operations-extended version","year":"0","author":"hanzaleh","key":"ref12"},{"key":"ref13","volume":"241","author":"zippel","year":"2012","journal-title":"Effective Polynomial Computation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"journal-title":"An improved e-voting scheme using secret sharing based secure multi-party computation","year":"2015","author":"nair","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref8","article-title":"Faster secure two-party computation using garbled circuits","volume":"201","author":"huang","year":"2011","journal-title":"USENIX Security Symposium"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11889663_10","article-title":"A practical implementation of secure auctions based on multiparty integer computation","volume":"4107","author":"bogetoft","year":"2006","journal-title":"Financial Cryptography"},{"key":"ref1","first-page":"2108","article-title":"Privacy preserving data mining: a state of the art","author":"narwaria","year":"2016","journal-title":"Computing for Sustainable Global Development (INDIACom) 2016 3rd International Conference on"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","article-title":"Sharemind: A framework for fast privacy-preserving computations","author":"bogdanov","year":"2008","journal-title":"Computer Security-ESORICS 2008"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437651.pdf?arnumber=8437651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:47:49Z","timestamp":1598240869000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437651","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}