GPIR: Enabling Practical Private Information Retrieval with GPUs
Hyesung Ji, Hyunah Yu, Jongmin Kim, Wonseok Choi, G. Edward Suh, Jung Ho Ahn

TL;DR
GPIR is a GPU-accelerated private information retrieval system that optimizes kernel design, data layout, and scheduling to significantly improve throughput and scalability over existing solutions.
Contribution
It introduces a stage-aware hybrid execution model and transposed-layout design, enabling efficient multi-GPU PIR with high throughput and minimal communication overhead.
Findings
GPIR achieves up to 297.2x higher throughput than PIRonGPU.
The system scales efficiently across multiple GPUs with negligible communication overhead.
Optimized kernel design and data layout significantly improve GPU PIR performance.
Abstract
Private information retrieval (PIR) allows private database queries; however, it is hindered by intense server-side computation and memory traffic. Numerous modern lattice-based PIR protocols consist of three phases: ExpandQuery (expanding a query into encrypted indices), RowSel (encrypted row selection), and ColTor (recursive "column tournament" for final selection). ExpandQuery and ColTor primarily perform number-theoretic transforms (NTTs), whereas RowSel reduces to large-scale independent matrix-matrix multiplications (GEMMs). GPUs are well suited for these tasks when combined with multi-client batching, which is necessary for high throughput. However, batching fundamentally reshapes the performance bottlenecks: while it amortizes database access costs, it expands working sets beyond the L2 cache capacity, causing divergent memory access behavior and excessive DRAM traffic. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
