Querying twice to achieve information-theoretic verifiability in private information retrieval

• Main Authors: Kruglik, Stanislav, Dau, Son Hoang, Kiah, Han Mao, Wang, Huaxiong, Zhang, Liang Feng
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2024
• Subjects: Physics; Private information retrieval; Security
• Online Access: https://hdl.handle.net/10356/180554
• Institution: Nanyang Technological University

Private Information Retrieval (PIR) protocols allow a client to retrieve any file of interest while keeping the files identity hidden from the database servers. While many existing PIR protocols assume servers to be honest but curious, we investigate the scenario of dishonest servers that provide incorrect answers to mislead clients into obtaining wrong results. We propose a unified framework for polynomial PIR protocols encompassing various existing protocols that optimize the download rate or total communication cost. We introduce a way to transform a polynomial PIR to a verifiable one without increasing the number of involved servers by doubling the queries. The security guarantees can be information-theoretic or computational, and the verification keys can be public or private. Moreover, in one of our protocols, the ratio between the additional download overhead associated with verification and the normal download cost approaches zero as the file size goes to infinity.