Two-Server Private Information Retrieval with High Throughput and Logarithmic Bandwidth

In this paper, we propose a high-throughput, logarithmic-bandwidth private information retrieval (PIR) scheme, which enables a client to securely retrieve any record from a database replicated on two remote servers without revealing the record index. Specifically, based on the puncturable pseudorandom function (PPRF), a client first leverages randomized mapping to locate a logarithmic-size punctured PRF key capable of replacing a randomized set of arbitrary size while concealing a chosen element within the set. With the key, the client then generates corresponding PIR queries for two servers, achieving logarithmic communication complexity. Upon receiving the queries, the servers independently perform level-I PPRF evaluations on partitioned databases, i.e., buckets, to obtain intermediate results, and cooperatively perform level-II PPRF evaluations on these results to provide fast PIR responses. The two-level recursive approach can significantly reduce the servers’ computational complexity from linear to sublinear, ensuring high throughput. Finally, we conduct a comprehensive security analysis and develop a proof-of-concept prototype to demonstrate the efficiency and security of the proposed PIR scheme.