{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:01:41Z","timestamp":1778605301387,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Basic Science Research Program through NRF"},{"name":"MSIP","award":["NRF-2017R1A2B2007102"],"award-info":[{"award-number":["NRF-2017R1A2B2007102"]}]},{"name":"Technology Innovation Program through MOTIE","award":["10051928"],"award-info":[{"award-number":["10051928"]}]},{"name":"Bio-Mimetic Robot Research Center through DAPA","award":["UD130070ID"],"award-info":[{"award-number":["UD130070ID"]}]},{"name":"INMAC"},{"name":"BK21-plus"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tifs.2018.2846601","type":"journal-article","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T19:00:45Z","timestamp":1528830045000},"page":"141-150","source":"Crossref","is-referenced-by-count":105,"title":["Secure Distributed Computing With Straggling Servers Using Polynomial Codes"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0906-0133","authenticated-orcid":false,"given":"Heecheol","family":"Yang","sequence":"first","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":"ref10","first-page":"1","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS) Workshop Mach Learn Syst"},{"key":"ref11","author":"halbawi","year":"2017","journal-title":"Improving distributed gradient descent using Reed-Solomon codes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/508171.508174"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_22"},{"key":"ref14","first-page":"1","article-title":"Privacy preserving multi-party machine learning with homomorphic encryption","author":"takabi","year":"2016","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS) Workshop Private Multi-Party Mach Learn"},{"key":"ref15","first-page":"1","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref16","first-page":"4427","article-title":"Federated multi-task learning","author":"smith","year":"2017","journal-title":"Proc 32nd Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref18","article-title":"Efficient and secure delegation of linear algebra","author":"mohassel","year":"2011"},{"key":"ref19","first-page":"158","article-title":"Efficient secure and verifiable outsourcing of matrix multiplications","author":"zhang","year":"2011","journal-title":"Proc Intl Conf Info Sec"},{"key":"ref28","article-title":"Fast evaluation and interpolation","author":"kung","year":"1973"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref27","author":"didier","year":"2009","journal-title":"Efficient erasure decoding of Reed–Solomon codes"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref29","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref5","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref8","author":"yu","year":"2017","journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.11.026"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755695"},{"key":"ref23","author":"bitar","year":"2018","journal-title":"Minimizing latency for secure coded computing using secret sharing via staircase codes"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8410643\/08382305.pdf?arnumber=8382305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:04:32Z","timestamp":1633921472000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8382305\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2018.2846601","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}