On single server private information retrieval in a coding theory perspective

08/14/2020
by   Gianira N. Alfarano, et al.
0

In this paper, we present a new perspective of single server private information retrieval (PIR) schemes by using the notion of linear error-correcting codes. Many of the known single server schemes are based on taking linear combinations between database elements and the query elements. Using the theory of linear codes, we develop a generic framework that formalizes all such PIR schemes. Further, we describe some known PIR schemes with respect to this code-based framework, and present the weaknesses of the broken PIR schemes in a generic point of view.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2021

Private Information Schemes Using Cyclic Codes

A Private Information Retrieval (PIR) scheme allows users to retrieve da...
research
01/20/2020

Computational Code-Based Single-Server Private Information Retrieval

A new computational private information retrieval (PIR) scheme based on ...
research
07/02/2021

PIR codes from combinatorial structures

A k-server Private Information Retrieval (PIR) code is a binary linear [...
research
02/15/2022

Constant-weight PIR: Single-round Keyword PIR via Constant-weight Equality Operators

Equality operators are an essential building block in tasks over secure ...
research
05/18/2018

Private Information Retrieval using Product-Matrix Minimum Storage Regenerating Codes

Private Information Retrieval (PIR) schemes allow a user to retrieve a r...
research
07/01/2019

On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes

Private Information Retrieval (PIR) problem has recently attracted a sig...
research
09/05/2018

Toward Validation of Textual Information Retrieval Techniques for Software Weaknesses

This paper presents a preliminary validation of common textual informati...

Please sign up or login with your details

Forgot password? Click here to reset