Low-Complexity PIR Using Subfield Subcodes

TL;DR

This paper introduces a low-complexity private information retrieval scheme that minimizes server computation by using subfield subcodes, enabling XOR operations for response calculation, especially with GRS codes.

Contribution

The paper proposes a PIR scheme leveraging subfield subcodes to reduce server computational complexity to XOR operations, a novel approach for efficient PIR implementation.

Findings

Server response computation requires only XOR operations.

Applicable to GRS codes and their subfield subcodes.

Potential for practical, low-complexity PIR systems.

Abstract

A major drawback of many PIR schemes is the highcomputational cost at the servers. We present a scheme that usesonly operations in the prime field during response generation.For binary extension fields this leads to schemes that only needXOR operations at the servers to calculate the responses. This isachieved by restricting the queries to a subfield subcode or tracecode. We investigate possible parameter ranges and focus on theexample of GRS codes and subfield subcodes of these.