PIR Codes with Short Block Length

Sascha Kurz; Eitan Yaakobi

doi:10.1007/s10623-020-00828-6

PIR Codes with Short Block Length

Sascha Kurz, Eitan Yaakobi

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	559-587
Number of pages	29
Journal	Designs, Codes, and Cryptography
Volume	89
Issue number	3
DOIs	https://doi.org/10.1007/s10623-020-00828-6
State	Published - Mar 2021

Keywords

Finite projective geometry
Linear codes
PIR codes
Private information retrieval

All Science Journal Classification (ASJC) codes

Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s10623-020-00828-6

Cite this

@article{64226a1ea61c490f81a44328b8d8e811,

title = "PIR Codes with Short Block Length",

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.",

keywords = "Finite projective geometry, Linear codes, PIR codes, Private information retrieval",

author = "Sascha Kurz and Eitan Yaakobi",

note = "Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature.",

year = "2021",

month = mar,

doi = "10.1007/s10623-020-00828-6",

language = "الإنجليزيّة",

volume = "89",

pages = "559--587",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - PIR Codes with Short Block Length

AU - Kurz, Sascha

AU - Yaakobi, Eitan

PY - 2021/3

Y1 - 2021/3

N2 - 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.

AB - 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.

KW - Finite projective geometry

KW - Linear codes

KW - PIR codes

KW - Private information retrieval

UR - http://www.scopus.com/inward/record.url?scp=85100009841&partnerID=8YFLogxK

U2 - 10.1007/s10623-020-00828-6

DO - 10.1007/s10623-020-00828-6

M3 - مقالة

SN - 0925-1022

VL - 89

SP - 559

EP - 587

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 3

ER -

PIR Codes with Short Block Length

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this