ZipPIR: High-throughput Single-server PIR without Client-side Storage

• URL: http://arxiv.org/abs/2603.09190v1
• Date: Tue, 10 Mar 2026 05:02:02 GMT
• Title: ZipPIR: High-throughput Single-server PIR without Client-side Storage
• Abstract summary: Private Information Retrieval (PIR) allows a client to privately access a database without revealing which element is accessed.<n>Initial PIR protocols based on Ring Learning with Errors (RLWE) demonstrated the practicality of PIR, but achieve limited throughput.<n>We propose ZipPIR, a high- throughput PIR protocol that compresses LWE ciphertexts into significantly smaller Paillier ciphertexts.
• Score: 22.65636380407472
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Private Information Retrieval (PIR) allows a client to privately access a database without revealing which element is accessed. Initial PIR protocols based on Ring Learning with Errors (RLWE) demonstrated the practicality of PIR, but achieve limited throughput. Alternatively, high-throughput protocols leverage an offline phase that requires substantial client-side storage (e.g., hints in SimplePIR) or involve prohibitive communication costs during the offline phase (e.g., Piano). These limitations conflict with the practical constraints of resource-limited clients and are further exacerbated by dynamic databases, where updates necessitate costly regeneration and retransmission of hints. To address these challenges, we propose ZipPIR, a high-throughput PIR protocol that compresses LWE ciphertexts into significantly smaller Paillier ciphertexts. ZipPIR leverages the offline phase to obtain this size reduction without incurring the associated computational cost in the online phase. Moreover, under computational assumptions, ZipPIR features an almost silent offline phase, requiring no communication beyond an initial public key, enabling the server to independently generate and update hints during idle times without client interaction. ZipPIR achieves over 2 GB/s of throughput - comparable to state-of-the-art protocols such as SimplePIR - without the need for a large client-stored hint. For PIR over a 1 GB database, ZipPIR has up to 10x higher throughput than existing protocols with no client-side storage, while requiring less than 200 KB of server-side storage per client, significantly enhancing scalability for practical deployments. While prior PIR protocols using Paillier are very inefficient, ZipPIR is the first PIR protocol using Paillier that achieves throughput that is competitive with state-of-the-art PIR protocols.

Related papers

• Lower Bounds for PIR with Preprocessing from Blackbox Cryptography [57.20693707878285]
  We study the limits of single-server private information retrieval (PIR) with preprocessing.<n>Our work presents computation lower bounds for any single-server PIR with preprocessing.
  arXiv  Detail & Related papers  (2026-07-07T16:12:48Z)
• VIPIR: A Versatile GPU Framework for Integrating Private Information Retrieval Protocols [13.257148302181086]
  VIPIR is a versatile GPU framework that co-designs PIR protocols with GPU acceleration.<n>We develop a unified analytic model showing that state-of-the-art PIR protocols fall into two categories with complementary limitations.<n>We propose two protocols that flexibly combine techniques across these categories, overcoming the limitations of both classes.
  arXiv  Detail & Related papers  (2026-06-10T00:40:14Z)
• IVE: An Accelerator for Single-Server Private Information Retrieval Using Versatile Processing Elements [4.085063539485129]
  IVE is an accelerator for single-server PIR with a systematic extension that enables retrieval from large databases using DRAM.<n>IVE achieves up to 1,275x higher throughput compared to prior PIR hardware solutions.
  arXiv  Detail & Related papers  (2025-12-01T11:47:26Z)
• A Unified Framework for Constructing Information-Theoretic Private Information Retrieval [5.025654873456755]
  em Private information retrieval (PIR) protocols allow a user to retrieve any entry from a database, without revealing the identity of the entry being retrieved to the server(s)<n>We introduce a new discrete structure called em families of unbounded arrays with span capability (FOASC) and propose a unified framework for constructing IT-PIR protocols.
  arXiv  Detail & Related papers  (2025-11-29T13:24:09Z)
• Enhancing TreePIR for a Single-Server Setting via Resampling [0.0]
  Private Information Retrieval allows a client to retrieve an entry from a public database without revealing the queried index.<n>Traditional PIR schemes achieve sublinear server computation only under strong assumptions.<n>We propose an adaptation of TreePIR to the single-server setting by introducing a dual-table hint structure.
  arXiv  Detail & Related papers  (2025-10-06T15:03:05Z)
• PWC-MoE: Privacy-Aware Wireless Collaborative Mixture of Experts [59.5243730853157]
  Large language models (LLMs) hosted on cloud servers alleviate the computational and storage burdens on local devices but raise privacy concerns.<n>Small language models (SLMs) running locally enhance privacy but suffer from limited performance on complex tasks.<n>We propose a privacy-aware wireless collaborative mixture of experts (PWC-MoE) framework to balance computational cost, performance, and privacy protection under bandwidth constraints.
  arXiv  Detail & Related papers  (2025-05-13T16:27:07Z)
• HE is all you need: Compressing FHE Ciphertexts using Additive HE [29.043858170208875]
  Homomorphic Encryption (HE) is a commonly used tool for building privacy-preserving applications. We present a new compression technique that uses an additive homomorphic encryption scheme with small ciphertexts to compress large homomorphic ciphertexts.
  arXiv  Detail & Related papers  (2023-03-16T02:28:40Z)
• ZipLM: Inference-Aware Structured Pruning of Language Models [56.52030193434863]
  We propose a novel structured compression approach for large language models (LLMs) called ZipLM. ZipLM achieves state-of-the-art accuracy-vs-speedup, while matching a set of desired target runtime speedups. ZipLM produces state-of-the-art compressed models across all settings.
  arXiv  Detail & Related papers  (2023-02-07T18:55:28Z)
• On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers [59.98425646542448]
  In quantum private information retrieval, a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file. The capacity of QPIR from MDS-coded and colluding servers is studied for the first time.
  arXiv  Detail & Related papers  (2021-06-28T13:48:22Z)
• Quantum Private Information Retrieval for Quantum Messages [71.78056556634196]
  Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved. We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states.
  arXiv  Detail & Related papers  (2021-01-22T10:28:32Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• BLAZE: Blazing Fast Privacy-Preserving Machine Learning [18.8081326324821]
  Privacy-preserving Machine Learning (PPML) is where privacy of the data is guaranteed. ThisMotivated the area of Privacy-preserving Machine Learning (PPML) where privacy of the data is guaranteed. In SOC setting, the computation is outsourced to a set of specialized and powerful cloud servers and the service is availed on a pay-per-use basis.
  arXiv  Detail & Related papers  (2020-05-18T19:18:22Z)
• Capacity of Quantum Private Information Retrieval with Colluding Servers [71.78056556634196]
  Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from non-communicating servers. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol.
  arXiv  Detail & Related papers  (2020-01-13T18:12:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.