Single Server Private Information Retrieval Protocols With Codes Over Rings

2023/11/08 by Şeyma Bodur, Bodur, Şeyma, Edgar Martı́nez-Moro +3 · 1 citation
Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2311.04688

openalex publication_date 2023/11/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30

Abstract

A Private Information Retrieval (PIR) protocol based on coding theory for a single server is proposed. It provides computational security against linear algebra attacks, addressing the main drawback of previous PIR proposals based on coding theory. The approach involves two types of codes each one over a different ring, an inner non-free linear code that will be used as a distinguisher of some elements added to the query matrix, and an outer code that will be used for generating the query matrix. Moreover, it only uses modular arithmetic at the server level and the recovering stage if the base ring chosen for the inner code is \mathbb Z_m.

Cited by

• CB-cPIR: Code-Based Computational Private Information Retrieval

Related

• On single server private information retrieval in a coding theory perspective
• Computational Code-Based Single-Server Private Information Retrieval
• On the Security of a Code-Based PIR Scheme
• CB-cPIR: Code-Based Computational Private Information Retrieval
• On an Equivalence Between Single-Server PIR with Side Information and\n Locally Recoverable Codes