{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:58:52Z","timestamp":1774418332625,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006684","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1028-1032","source":"Crossref","is-referenced-by-count":10,"title":["Security for minimum storage regenerating codes and locally repairable codes"],"prefix":"10.1109","author":[{"given":"Swanand","family":"Kadhe","sequence":"first","affiliation":[]},{"given":"Alex","family":"Sprintson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"rawat","year":"2016","journal-title":"A note on secure minimum storage regenerating codes"},{"key":"ref11","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inform Transmission"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref16","author":"ye","year":"2016","journal-title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth"},{"key":"ref17","author":"hu","year":"2017","journal-title":"Lower bounds for error-correcting codes with local recovery"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133754"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570831"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605118"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006684.pdf?arnumber=8006684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T19:59:03Z","timestamp":1513195143000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006684\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006684","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}