Efficient Single-Server Private Information Retrieval Based on LWE Encryption

Hai Huang, Zhibo Guan, Bin Yu (), Xiang Li, Mengmeng Ge, Chao Ma and Xiangyu Ma
Additional contact information
Hai Huang: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Zhibo Guan: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Bin Yu: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Xiang Li: Department of Computer Science, City University of Hong Kong, Hong Kong 610200, China
Mengmeng Ge: College of Computing and Data Science, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore
Chao Ma: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Xiangyu Ma: School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China

Mathematics, 2025, vol. 13, issue 21, 1-20

Abstract: Private Information Retrieval (PIR) is a cryptographic protocol that allows users to retrieve data from one or more databases without revealing any information about their queries. Among existing PIR protocols, single-server schemes based on the Learning With Errors (LWE) assumption currently constitute the most practical class of constructions. However, existing schemes continue to suffer from high client-side preprocessing complexity and significant server-side storage overhead, leading to degraded overall performance. We propose ShufflePIR, a single-server protocol that marks the first introduction of an SM3-based pseudorandom function into the PIR framework for shuffling during preprocessing and utilizes cryptographic hardware to accelerate computation, thereby improving both efficiency and security. In addition, the adoption of a parallel encryption scheme based on the LWE assumption significantly enhances the client’s computational efficiency when processing long-bit data. We evaluate the performance of our protocol against the latest state-of-the-art PIR schemes. Simulation results demonstrate that ShufflePIR achieves a throughput of 9903 MB/s on a 16 GB database with 1 MB records, outperforming existing single-server PIR schemes. Overall, ShufflePIR provides an efficient and secure solution for privacy-preserving information retrieval in a wide range of applications.

Keywords: private information retrieval; learning with errors; single server (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/21/3373/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/21/3373/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:21:p:3373-:d:1777628

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().