Abstract
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.
Original language | English |
---|---|
Number of pages | 12 |
Publication status | Published - 18 Sept 2017 |
MoE publication type | Not Eligible |
Event | International Workshop on Coding and Cryptography - Saint-Petersburg, Russian Federation Duration: 18 Sept 2017 → 22 Sept 2017 Conference number: 10 |
Workshop
Workshop | International Workshop on Coding and Cryptography |
---|---|
Abbreviated title | WCC |
Country/Territory | Russian Federation |
City | Saint-Petersburg |
Period | 18/09/2017 → 22/09/2017 |