Information-Theoretic Authenticated PIR: From PIR-RV To APIR

TL;DR

This paper introduces an information-theoretic framework for secure, unconditionally private, and integrity-preserving Private Information Retrieval, enabling conversion from PIR-RV to APIR without additional overhead.

Contribution

It formalizes the security definitions for itAPIR, relates it to itPIR-RV, and proves a conversion theorem to upgrade schemes, advancing quantum-resistant PIR security.

Findings

Established a formal security definition for itAPIR.

Proved that itPIR-RV schemes can be converted to itAPIR schemes.

Bridged the gap between PIR-RV and APIR for quantum-resistant applications.

Abstract

Private Information Retrieval (PIR) allows clients to retrieve database entries without leaking retrieval indices, yet malicious servers seriously compromise retrieval correctness. Existing Authenticated PIR (APIR) schemes resist selective-failure attacks but rely on computational hardness assumptions. In contrast, information-theoretic PIR with Result Verification (itPIR-RV) achieves integrity without computational assumptions, yet only provides relaxed query privacy with no defense against selective-failure attacks. This paper focuses on unconditionally secure information-theoretic APIR (itAPIR) constructions. We propose the rigorous information-theoretic security definition for itAPIR with statistical privacy against selective-failure attacks and integrity as core properties, formalize the hierarchical relation between itAPIR and itPIR-RV as a relaxed variant with identical integrity but basic query privacy, and prove a conversion theorem that valid itPIR-RV schemes can be directly upgraded to secure itAPIR with no extra overhead. Our work bridges the theoretical gap, simplifies itAPIR design, and enables quantum-resistant PIR in malicious server environments.