Efficient Private Information Retrieval Scheme with Dynamic Database
Open Access
- 29 August 2025
- journal article
- research article
- Published by MDPI AG in Electronics
- Vol. 14 (17) , 3441
Abstract
Private information retrieval (PIR) is a typical application scenario of encrypted computing, which allows users to retrieve data from a database by providing only an encrypted index. In an academic research scenario, multiple parties may entrust their data to a third party and require collaborative retrieval. However, due to competitive relationships and mutual distrust between these parties, they do not share public–private keys, making single-key mechanisms inadequate for meeting actual privacy requirements. In this case, based on the multi-key fully homomorphic encryption (MKFHE) algorithm, we construct an efficient PIR scheme with an access permission verification mechanism and dynamic database. Specifically, we design an MKFHE algorithm to protect multi-user privacy information. The vector–matrix multiplication optimization algorithm is adopted to improve computational efficiency, the expand algorithm is used to reduce user communication traffic, and homomorphic multiplication with ciphertext chunking is used to avoid excessive noise caused by direct ciphertext multiplication. Experiments based on the SEAL library show that by transferring part of the computational pressure to the offline stage, the online query response efficiency of our scheme is improved by about 7.69%, and the online computational efficiency of vector–matrix multiplication is improved by about 19.7%.Keywords
Funding Information
- National Key R&D Program of China (2023YFB3106200)
- The 30th Research Institute of China Electronics Technology Group Corporation (2023YFB3106200)
This publication has 14 references indexed in Scilit:
- SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition2022
- Efficient Multi-Key FHE With Short Extended Ciphertexts and Directed Decryption ProtocolIEEE Access, 2019
- Secure Outsourced Matrix Computation and Application to Neural Networks2018
- PIR with Compressed Queries and Amortized Query Processing2018
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based2013
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption2012
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller2012
- Fully Homomorphic Encryption with Polylog Overhead2012
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Fully homomorphic encryption using ideal lattices2009