{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:08:19Z","timestamp":1780726099636,"version":"3.54.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["725731"],"award-info":[{"award-number":["725731"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1526547"],"award-info":[{"award-number":["CNS-1526547"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1525629"],"award-info":[{"award-number":["CCF-1525629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tifs.2020.2972166","type":"journal-article","created":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T21:20:16Z","timestamp":1581024016000},"page":"2722-2734","source":"Crossref","is-referenced-by-count":84,"title":["Private and Secure Distributed Matrix Multiplication With Flexible Communication Load"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3782-6570","authenticated-orcid":false,"given":"Malihe","family":"Aliasgari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9898-3209","authenticated-orcid":false,"given":"Osvaldo","family":"Simeone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0942-8006","authenticated-orcid":false,"given":"Jorg","family":"Kliewer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849252"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref31","first-page":"72","article-title":"A survey on private information retrieval","volume":"82","author":"gasarch","year":"2004","journal-title":"Bull EATCS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919808"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849842"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849524"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869791"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437525"},{"key":"ref13","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2018","journal-title":"arXiv 1801 10292"},{"key":"ref14","article-title":"A unified coded deep neural network training strategy based on generalized polydot codes for matrix multiplication","author":"dutta","year":"2018","journal-title":"arXiv 1811 10751"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref19","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv 1806 00939"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"key":"ref29","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv 1908 06957"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref2","article-title":"Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods","author":"janzamin","year":"2015","journal-title":"arXiv 1506 08473"},{"key":"ref9","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref42","author":"kung","year":"2009","journal-title":"Fast evaluation and interpolation"},{"key":"ref24","article-title":"Random convolutional coding for robust and straggler resilient distributed matrix computation","author":"das","year":"2019","journal-title":"arXiv 1907 08064"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref23","article-title":"GASP codes for secure distributed matrix multiplication","author":"d\u2019oliveira","year":"2018","journal-title":"arXiv 1812 09962"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849507"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3"},{"key":"ref43","author":"ross","year":"2014","journal-title":"Introduction to Probability Models"},{"key":"ref25","article-title":"Secure coded multi-party computation for massive matrix operations","author":"nodehi","year":"2019","journal-title":"arXiv 1908 04255"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/10206\/8833568\/8985291-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8833568\/08985291.pdf?arnumber=8985291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:00:46Z","timestamp":1651078846000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8985291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/tifs.2020.2972166","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}