{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:06:02Z","timestamp":1725775562719},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437311","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1739-1743","source":"Crossref","is-referenced-by-count":16,"title":["Private Information Retrieval is Graph Based Replication Systems"],"prefix":"10.1109","author":[{"given":"Netanel","family":"Raviv","sequence":"first","affiliation":[]},{"given":"Itzhak","family":"Tamot","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2442231"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"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\/ISIT.2017.8006647"},{"journal-title":"Codes for Erasures over Directed Graphs","year":"2017","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"journal-title":"Apache Cassandra ™ 2 1 for DSE Data replication","year":"0","key":"ref3"},{"journal-title":"Private information retrieval from coded databases with colluding servers","year":"2016","author":"freij-hollanti","key":"ref6"},{"journal-title":"PIR with low storage overhead Coding instead of replication","year":"2015","author":"fazeli","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620277"},{"journal-title":"Hadoop Distributed File System (HDFS) Architecture Guide - Data replication","year":"0","key":"ref7"},{"journal-title":"PIR schemes with small download complexity and low storage requirements","year":"2016","author":"blackburn","key":"ref2"},{"journal-title":"Pir array codes with optimal PIR rate","year":"2016","author":"blackburn","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437311.pdf?arnumber=8437311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T18:18:28Z","timestamp":1598206708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437311\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437311","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}