Private Information Retrieval from Locally Repairable Databases with Colluding Servers

Understand

We consider information-theoretical private information retrieval (PIR) from a coded database with colluding servers.

• We target, for the first time, locally repairable storage codes (LRCs).
• We consider any number of local groups $ g $, locality $ r $, local distance $ \delta $ and dimension $ k $.
• Our main contribution is a PIR scheme for maximally recoverable (MR) LRCs based on linearized Reed--Solomon codes, which achieve the smallest field sizes among MR-LRCs for many parameter regimes.