Robust Private Information Retrieval on Coded Data

July 31, 2017 Β· Declared Dead Β· πŸ› International Symposium on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Razane Tajeddine, Salim El Rouayheb arXiv ID 1707.09916 Category cs.IT: Information Theory Citations 40 Venue International Symposium on Information Theory Last Checked 6 months ago
Abstract
We consider the problem of designing PIR scheme on coded data when certain nodes are unresponsive. We provide the construction of $Ξ½$-robust PIR schemes that can tolerate up to $Ξ½$ unresponsive nodes. These schemes are adaptive and universally optimal in the sense of achieving (asymptotically) optimal download cost for any number of unresponsive nodes up to $Ξ½$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted