{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:50:59Z","timestamp":1725792659345},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007011","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2658-2662","source":"Crossref","is-referenced-by-count":23,"title":["PIR array codes with optimal PIR rates"],"prefix":"10.1109","author":[{"given":"Simon R.","family":"Blackburn","sequence":"first","affiliation":[]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"journal-title":"Lower bound on the redundancy of PIR codes","year":"2016","author":"rao","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"journal-title":"On private information retrieval array codes","year":"2016","author":"zhang","key":"ref13"},{"journal-title":"Private information retrieval for coded storage","year":"2014","author":"chan","key":"ref4"},{"journal-title":"PIR schemes with small download complexity and low storage requirements","year":"2016","author":"blackburn","key":"ref3"},{"key":"ref6","first-page":"2852","article-title":"Coded for distributed PIR with low storage overhead","author":"fazeli","year":"2015","journal-title":"Proc IEEE International Symposium on Information Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"journal-title":"Private information retrieval without storage overhead coding instead of replication","year":"2015","author":"fazeli","key":"ref7"},{"journal-title":"Pir array codes with optimal PIR rate","year":"2016","author":"blackburn","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12280-9_15"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","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\/08007011.pdf?arnumber=8007011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T04:25:32Z","timestamp":1504067132000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007011","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}