Abstrakti
We present private information retrieval protocols for coded
storage with colluding servers. While previous schemes require field sizes
that grow with the number of servers and files in the system, we restrict
the field size and focus especially on the binary case. Reed-Muller codes
are shown to be especially useful in this regard and explicit parameters
are calculated.
storage with colluding servers. While previous schemes require field sizes
that grow with the number of servers and files in the system, we restrict
the field size and focus especially on the binary case. Reed-Muller codes
are shown to be especially useful in this regard and explicit parameters
are calculated.
| Alkuperäiskieli | Englanti |
|---|---|
| Sivumäärä | 12 |
| Tila | Julkaistu - 18 syysk. 2017 |
| OKM-julkaisutyyppi | Ei oikeutettu |
| Tapahtuma | International Workshop on Coding and Cryptography - Saint-Petersburg, Venäjä Kesto: 18 syysk. 2017 → 22 syysk. 2017 Konferenssinumero: 10 |
Workshop
| Workshop | International Workshop on Coding and Cryptography |
|---|---|
| Lyhennettä | WCC |
| Maa/Alue | Venäjä |
| Kaupunki | Saint-Petersburg |
| Ajanjakso | 18/09/2017 → 22/09/2017 |