Reed-Muller Codes for Private Information Retrieval
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
12
Series
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.Description
Keywords
Other note
Citation
Freij-Hollanti, R, Gnilke, O, Hollanti, C, Horlemann-Trautmann, A-L, Karpuk, D & Kubjas, I 2017, 'Reed-Muller Codes for Private Information Retrieval', Paper presented at International Workshop on Coding and Cryptography, Saint-Petersburg, Russian Federation, 18/09/2017 - 22/09/2017.