t-private information retrieval schemes using transitive codes

DOI10.1109/TIT.2018.2871050MaRDI QIDQ5223919zbMATH OpenOpenAlexFDO

Authors Oliver Wilhelm Gnilke, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas, Ragnar Freij-Hollanti, Camilla Hollanti

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.02850

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Abstract: This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed and the resulting PIR rate is calculated explicitly. It is shown that codes with transitive automorphism groups yield the highest possible rates obtainable with the proposed scheme. This rate coincides with the known asymptotic PIR capacity for MDS-coded storage systems without collusion. While many PIR schemes in the literature require field sizes that grow with the number of servers and files in the system, we focus especially on the case of a binary base field, for which Reed- Muller codes serve as an important and explicit class of examples.

Cited in

(4)

• PIR codes with short block length
• Private information retrieval schemes using cyclic codes
• PIR schemes from nD-cyclic and nD-constacyclic codes and their monomial equivalence
• The Schur product of evaluation codes and its application to CSS-T quantum codes and private information retrieval

This page was built for publication: $t$-private information retrieval schemes using transitive codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223919)