{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:13:53Z","timestamp":1725581633899},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006507","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"146-150","source":"Crossref","is-referenced-by-count":8,"title":["PIR schemes with small download complexity and low storage requirements"],"prefix":"10.1109","author":[{"given":"Simon R.","family":"Blackburn","sequence":"first","affiliation":[]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[]},{"given":"Maura B.","family":"Paterson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Private information retrieval without storage overhead coding instead of replication","year":"2015","author":"fazeli","key":"ref10"},{"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.2014.6874954"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842315"},{"journal-title":"The Capacity of Robust Private Information Retrieval with Colluding Databases","year":"2016","author":"sun","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7849060"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"journal-title":"Private information retrieval for coded storage","year":"2014","author":"chan","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006507"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2432740"},{"key":"ref7","first-page":"437","article-title":"Multi-server private information retrieval over uns ynchronized databases","author":"fanti","year":"2014","journal-title":"Fifty-second Annual Allerton Conference"},{"journal-title":"Pir array codes with optimal PIR rate","year":"2016","author":"blackburn","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12280-9_15"},{"key":"ref9","first-page":"2852","article-title":"Coded for distributed PIR with low storage overhead","author":"fazeli","year":"2015","journal-title":"IEEE Int Symp on Inf Theory (ISIT)"}],"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\/08006507.pdf?arnumber=8006507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T23:56:35Z","timestamp":1506988595000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006507\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006507","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}