{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:32Z","timestamp":1730279072529,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613503","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes"],"prefix":"10.1109","author":[{"given":"Siddhartha","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Hsuan-Yin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Eirik","family":"Rosnes","sequence":"additional","affiliation":[]},{"given":"Alexandre Graell i","family":"Amat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Achieving maximum distance separable private information retrieval capacity with linear codes","author":"kumar","year":"2017","journal-title":"arXiv 1712 03898v4 [cs IT]"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref14","article-title":"Erasure coding in Windows Azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annual Tech Conf"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref8","first-page":"647","article-title":"Private information retrieval from coded databases with colluding servers","volume":"1","author":"freij-hollanti","year":"2017","journal-title":"Journal of Pure and Applied Algebra"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006763"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref9","article-title":"t-private information retrieval schemes using transitive codes","author":"freij-hollanti","year":"2017","journal-title":"arXiv 1712 02850v1 [cs IT]"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613503.pdf?arnumber=8613503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:38:08Z","timestamp":1643240288000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613503\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613503","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}