Private information retrieval from coded databases with colluding servers

Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

151 Citationer (Scopus)

Abstract

We present a general framework for private information retrieval (PIR) from arbitrary coded databases that allows one to adjust the rate of the scheme to the suspected number of colluding servers. If the storage code is a generalized Reed–Solomon code of length n and dimension k, we design PIR schemes that achieve a PIR rate of n-(k+t-1) while protecting against any t colluding servers, for n any 1 ≤ t ≤ n - k. This interpolates between the previously studied cases of t = 1 and k = 1 and achieves PIR capacity in both of these cases asymptotically as the number of files in the database grows.

OriginalsprogEngelsk
TidsskriftSIAM Journal on Applied Algebra and Geometry
Vol/bind1
Udgave nummer1
Sider (fra-til)647-664
Antal sider18
DOI
StatusUdgivet - 2017

Fingeraftryk

Dyk ned i forskningsemnerne om 'Private information retrieval from coded databases with colluding servers'. Sammen danner de et unikt fingeraftryk.

Citationsformater