{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:41:22Z","timestamp":1774021282580,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874954","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"856-860","source":"Crossref","is-referenced-by-count":167,"title":["One extra bit of download ensures perfectly private information retrieval"],"prefix":"10.1109","author":[{"given":"Nihar B.","family":"Shah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"13","article-title":"Building dissent networks: Towards effective countermeasures against large-scale communications blackouts","author":"hasan","year":"2013","journal-title":"FOCI"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"11","year":"0","journal-title":"HDFS RAID"},{"key":"12","article-title":"A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster","author":"rashmi","year":"2013","journal-title":"Proc USENIX HotStorage"},{"key":"3","year":"0","journal-title":"Stealth Software Inc"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2229783"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046784"},{"key":"10","article-title":"Availability in globally distributed storage systems","author":"ford","year":"2010","journal-title":"USENIX OSDI"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63165-8_196","article-title":"Upper bound on the communication complexity of private information retrieval","author":"ambainis","year":"1997","journal-title":"Automata Languages and Programming"},{"key":"6","article-title":"Private information retrieval","author":"chor","year":"1995","journal-title":"Proc FOCS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14358-8_4"},{"key":"9","article-title":"Breaking the O(n1\/(2k-1)) barrier for information-theoretic private information retrieval","author":"beimel","year":"2002","journal-title":"FOCS"},{"key":"8","article-title":"A random server model for private information retrieval","author":"gertner","year":"1998","journal-title":"Rand and Approx Tech in CS"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","location":"Honolulu, HI, USA","start":{"date-parts":[[2014,6,29]]},"end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874954.pdf?arnumber=6874954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:21:51Z","timestamp":1602688911000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874954","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}