{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:34:16Z","timestamp":1783096456366,"version":"3.54.6"},"reference-count":82,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CIF-0964018"],"award-info":[{"award-number":["CIF-0964018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CIF-1116404"],"award-info":[{"award-number":["CIF-1116404"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005801","name":"Facebook Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research Ph.D. Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Berkeley Fellowship"},{"DOI":"10.13039\/100006112","name":"Microsoft Research Ph.D. Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 1421848"],"award-info":[{"award-number":["CCF 1421848"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"joint UGC-ISF Research","award":["1676\/14"],"award-info":[{"award-number":["1676\/14"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tit.2017.2769101","type":"journal-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T20:46:48Z","timestamp":1509655608000},"page":"1621-1646","source":"Crossref","is-referenced-by-count":25,"title":["Information-Theoretically Secure Erasure Codes for Distributed Storage"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2227-7460","authenticated-orcid":false,"given":"K. V.","family":"Rashmi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5158-9677","authenticated-orcid":false,"given":"Nihar B.","family":"Shah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0990-2847","authenticated-orcid":false,"given":"P. Vijay","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195641"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006603"},{"key":"ref71","author":"huang","year":"2015","journal-title":"On secrecy capacity of minimum storage regenerating codes"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421189"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513354"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620356"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2011.6038668"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033778"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.78"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref33","year":"2012","journal-title":"Yahoo Confirms Apologizes for the Email Hack Says Still Fixing TechCrunch"},{"key":"ref32","year":"2012","journal-title":"LinkedIn Hack is Latest Blow to Online Confidence USA Today"},{"key":"ref31","year":"2011","journal-title":"Citi Data Theft Points Up a Nagging Problem CNBC"},{"key":"ref30","author":"jiekak","year":"2012","journal-title":"CROSS-MBCR Exact Minimum Bandwidth Coordinated Regenerating Codes"},{"key":"ref37","first-page":"1","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref36","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref61","author":"goparaju","year":"2016","journal-title":"Minimum storage regenerating codes for all parameters"},{"key":"ref63","author":"sasidharan","year":"2013","journal-title":"An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620463"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483348"},{"key":"ref27","author":"gerami","year":"2013","journal-title":"Optimized-cost Repair in Multi-hop Distributed Storage Systems with Network Coding"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570831"},{"key":"ref66","author":"tandon","year":"2013","journal-title":"Towards Optimal Secure Distributed Storage Systems with Exact Repair"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.040213.130006"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.131210"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875177"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028489"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283046"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref22","author":"gast\u00f3n","year":"2012","journal-title":"Quasi-cyclic flexible regenerating codes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620499"},{"key":"ref24","author":"li","year":"2013","journal-title":"A framework of constructions of minimal storage regenerating codes with the optimal access\/update property"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.2297109"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620501"},{"key":"ref25","author":"kurihara","year":"2013","journal-title":"Generalization of Rashmi–Shah–Kumar minimum-storage-regenerating codes"},{"key":"ref50","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes Part I"},{"key":"ref51","first-page":"401","article-title":"EC-cache: Load-balanced, low-latency cluster caching with online erasure coding","author":"rashmi","year":"2016","journal-title":"Proc of USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567040"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283044"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140518"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref53","first-page":"17","article-title":"Why let resources idle? Aggressive cloning of jobs with dolly","author":"ananthanarayanan","year":"2012","journal-title":"Proc USENIX HotCloud"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390234"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503165"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref82","author":"bernstein","year":"2005","journal-title":"Matrix Mathematics Theory Facts and Formulas With Application to Linear Systems Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref4","first-page":"8","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"Proc USENIX HotStorage"},{"key":"ref3","first-page":"61","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"Proc USENIX Symp on Operating System Design and Implementation"},{"key":"ref6","year":"2017","journal-title":"HDFS and Erasure Codes (HDFS-RAID)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"key":"ref8","first-page":"81","article-title":"Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth","author":"rashmi","year":"2015","journal-title":"Proc USENIX Conf File Storage Technol (FAST)"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/2740070.2626325","article-title":"A ‘Hitchhiker’s’ guide to fast and efficient data reconstruction in erasure-coded data centers","author":"rashmi","year":"2014","journal-title":"Proc ACM Sigcomm"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875270"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620462"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282577"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282817"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394912"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191401"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090197"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2294254"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/8293743\/8094011-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8293743\/08094011.pdf?arnumber=8094011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:30Z","timestamp":1649444010000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8094011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":82,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2769101","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}