Name
Abstract | ||
|---|---|---|
private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes have been proposed for several kinds of storage systems, including replicated and MDS-coded data. In this paper, the problem of constructing a PIR scheme on regenerating codes is considered. A regenerating code is a storage code whose codewords are distributed among $n$ nodes, enabling efficient storage of files, as well as low-bandwidth retrieval of files and repair of nodes. In this work, a PIR scheme on regenerating codes is constructed, using the product-matrix (PM) framework of Rashmi, Shah and Kumar. Both the minimum-bandwidth (MBR) and minimum-storage (MSR) settings are considered, and the structure given by the PM framework is used in order to reduce the download communication complexity of our schemes. |
Year | Venue | DocType |
|---|---|---|
2018 | arXiv: Information Theory | Journal |
Volume | Citations | PageRank |
abs/1811.02898 | 0 | 0.34 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Lavauzelle | 1 | 0 | 0.68 |
| Razane Tajeddine | 2 | 0 | 0.34 |
| Ragnar Freij-Hollanti | 3 | 50 | 7.58 |
| Camilla Hollanti | 4 | 308 | 40.21 |