PIR codes with short block length

DOI10.1007/S10623-020-00828-6MaRDI QIDQ2657142zbMATH OpenOpenAlexFDO

Authors Sascha Kurz, Eitan Yaakobi

Publication date 17 March 2021

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.03433, https://epub.uni-bayreuth.de/4578/1/PIR_ISIT.pdf

zbMATH Keywords

finite projective geometrylinear codesPIR codesprivate information retrieval

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Information storage and retrieval of data (68P20) Privacy of data (68P27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Linear codes (general theory) (94B05)

Abstract: In this work private information retrieval (PIR) codes are studied. In a $k$-PIR code, $s$ information bits are encoded in such a way that every information bit has $k$ mutually disjoint recovery sets. The main problem under this paradigm is to minimize the number of encoded bits given the values of $s$ and $k$, where this value is denoted by $P(s,k)$. The main focus of this work is to analyze $P(s,k)$ for a large range of parameters of $s$ and $k$. In particular, we improve upon several of the existing results on this value.

Recommendations

• PIR codes from combinatorial structures
• PIR Schemes With Small Download Complexity and Low Storage Requirements
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Bounds on the Length of Functional PIR and Batch Codes
• Nearly Optimal Constructions of PIR and Batch Codes
• Array Codes for Functional PIR and Batch Codes
• Rate-compatible punctured low-density parity-check codes with short block lengths
• On computational shortcuts for information-theoretic PIR
• Shortened Polar Codes

Cites work

• $t$-private information retrieval schemes using transitive codes
• A Bound for Error-Correcting Codes
• A note on the Griesmer bound (Corresp.)
• Error control coding. Fundamentals and applications
• Locality and Availability in Distributed Storage
• Nearly Optimal Constructions of PIR and Batch Codes
• On a Class of One-Step Majority-Logic Decodable Cyclic Codes
• On the uniqueness of the Golay codes
• Partial spreads in finite projective spaces and partial designs
• Private information retrieval
• Projective Reed-Muller type codes on higher dimensional scrolls
• The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
• Unrestricted codes with the Golay parameters are unique

Cited in

(5)

• PIR Array Codes With Optimal Virtual Server Rate
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Optimal possibly nonlinear 3-PIR codes of small size
• PIR codes from combinatorial structures
• Private information retrieval schemes using cyclic codes

Describes a project that uses

Uses Software

• Code Tables

This page was built for publication: PIR codes with short block length

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