{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T11:09:20Z","timestamp":1778929760903,"version":"3.51.4"},"reference-count":32,"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":"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\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2017R1A2B2007102"],"award-info":[{"award-number":["NRF-2017R1A2B2007102"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Science and ICT"},{"name":"Technology Innovation Program","award":["10051928"],"award-info":[{"award-number":["10051928"]}]},{"DOI":"10.13039\/501100003052","name":"Ministry of Trade, Industry and Energy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003052","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bio-Mimetic Robot Research Center"},{"DOI":"10.13039\/501100003626","name":"Defense Acquisition Program Administration","doi-asserted-by":"publisher","award":["UD130070ID"],"award-info":[{"award-number":["UD130070ID"]}],"id":[{"id":"10.13039\/501100003626","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Samsung Electronics AI Grant"},{"name":"Ministry of Trade, Industry and Energy (Korea Government)-Institute of Information and Communications Technology Planning and Evaluation","award":["2019-0-01367 (BabyMind)"],"award-info":[{"award-number":["2019-0-01367 (BabyMind)"]}]},{"name":"Institute of New Media And Communications"},{"name":"BK21-plus"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tifs.2019.2940895","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T19:42:28Z","timestamp":1568230948000},"page":"1434-1443","source":"Crossref","is-referenced-by-count":30,"title":["Private Coded Matrix Multiplication"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0987-3911","authenticated-orcid":false,"given":"Minchul","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0906-0133","authenticated-orcid":false,"given":"Heecheol","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6804-980X","authenticated-orcid":false,"given":"Jungwoo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref31","article-title":"Speeding up distributed gradient descent by utilizing non-persistent stragglers","author":"ozafatura","year":"2018","journal-title":"arXiv 1808 02240"},{"key":"ref30","article-title":"Private polynomial computation from Lagrange encoding","author":"raviv","year":"2018","journal-title":"arXiv 1812 04142"},{"key":"ref10","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref14","article-title":"Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"2018","journal-title":"arXiv 1810 13006"},{"key":"ref15","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv 1806 00939"},{"key":"ref16","article-title":"GASP codes for secure distributed matrix multiplication","author":"d\u2019oliveira","year":"2018","journal-title":"arXiv 1812 09962"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905981"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636039"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437655"},{"key":"ref3","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref29","article-title":"The capacity of private computation","author":"sun","year":"2017","journal-title":"arXiv 1710 11098"},{"key":"ref5","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot product","author":"dutta","year":"2017","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref8","first-page":"1","article-title":"A unified coding framework for distributed computing with straggling servers","author":"li","year":"2017","journal-title":"Proc Global Commun Conf (GLOBECOM)"},{"key":"ref7","article-title":"Improving distributed gradient descent using Reed–Solomon codes","author":"halbawi","year":"2017","journal-title":"arXiv 1706 05436"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335367"},{"key":"ref21","article-title":"The capacity of private information retrieval from byzantine and colluding databases","author":"banawan","year":"2017","journal-title":"arXiv 1706 01442"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7849060"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844940"},{"key":"ref26","article-title":"Private function retrieval","author":"mirmohseni","year":"2017","journal-title":"arXiv 1711 04677"},{"key":"ref25","article-title":"Cross subspace alignment and the asymptotic capacity of X-secure T-private information retrieval","author":"jin","year":"2018","journal-title":"arXiv 1808 07457"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8833568\/08832193.pdf?arnumber=8832193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:00:41Z","timestamp":1651078841000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8832193\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/tifs.2019.2940895","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}