VPIR: an efficient verifiable private information retrieval scheme resisting malicious cloud server

Wenqi Zhang (), Shuai Shang (), Haolin Wang (), Ziwen Cai (), Yun Zhao () and Xiong Li ()
Additional contact information
Wenqi Zhang: University of Electronic Science and Technology of China
Shuai Shang: University of Electronic Science and Technology of China
Haolin Wang: Electric Power Research Institute of CSG
Ziwen Cai: Electric Power Research Institute of CSG
Yun Zhao: Electric Power Research Institute of CSG
Xiong Li: University of Electronic Science and Technology of China

Telecommunication Systems: Modelling, Analysis, Design and Management, 2024, vol. 86, issue 4, No 9, 743-755

Abstract: Abstract Private information retrieval, which allows users to securely retrieve information stored in a single server or multiple servers without disclosing any query content to the server, has attracted much attention in recent years. However, most of the existing private information retrieval schemes cannot achieve data retrieval and data integrity authentication simultaneously. To address the above challenges, this paper proposes a verifiable private information retrieval scheme based on parity in a single-server architecture. Specifically, the data owner generates parity information for each data and extends the original database. Then the data owner generates hint information for the query client, and according to the inverse of the hint information, the matrix confusion and permutation of the extensible database are carried out on the database and the hint information is sent to the client. The client selects the corresponding element in the hint to generate the query vector and executes the reconstruction and verification phase after receiving the answer to accomplish the retrieval process. A series of security games prove that this scheme meets the privacy requirements defined by the PIR scheme, and experimental analysis shows that compared with related schemes, our scheme has certain advantages in time cost. The time of verification information generation is 0.3% of APIR and FMAPIR, the reconstruction time is 1.6% of APIR and 1.1% of FMAPIR and the query time is much less than them.

Keywords: Private information retrieval; Verification; Malicious adversary; Parity; Single-server (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-024-01162-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:telsys:v:86:y:2024:i:4:d:10.1007_s11235-024-01162-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-024-01162-1

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().