OnionPIRv2: Efficient Single-Server PIR

Yue Chen; Ling Ren

Paper 2025/1142

OnionPIRv2: Efficient Single-Server PIR

Yue Chen

, University of Illinois Urbana-Champaign

Ling Ren

, University of Illinois Urbana-Champaign

Abstract

This paper presents OnionPIRv2, an efficient implementation of OnionPIR incorporating standard orthogonal techniques and engineering improvements. OnionPIR is a single-server PIR scheme that improves response size and computation cost by utilizing recent advances in somewhat homomorphic encryption (SHE) and carefully composing two lattice-based SHE schemes to control the noise growth of SHE. OnionPIRv2 achieves $3.7 \times$ response overhead for $3$ KB entries and up to $1372$ MB/s server computation throughput in our evaluation.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Private Information Retrieval
Contact author(s): yuec12 @ illinois edu
renling @ illinois edu
History: 2026-05-12: revised; 2025-06-17: received; See all versions
Short URL: https://ia.cr/2025/1142
License: CC BY

BibTeX

@misc{cryptoeprint:2025/1142,
      author = {Yue Chen and Ling Ren},
      title = {{OnionPIRv2}: Efficient Single-Server {PIR}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1142},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1142}
}