List-Decodable Byzantine Robust PIR: Lower Communication Complexity, Higher Byzantine Tolerance, Smaller List Size

TL;DR

This paper introduces two novel list-decodable Byzantine robust PIR schemes that achieve lower communication complexity, tolerate a majority of malicious servers, and have smaller list sizes.

Contribution

The schemes are the first to simultaneously handle majority malicious servers, reduce communication complexity to o(n^{1/2}), and estimate list sizes.

Findings

Achieve communication complexity of o(n^{1/2})

Handle a majority of malicious responding servers

Provide a nontrivial estimation on list sizes

Abstract

Private Information Retrieval (PIR) is a privacy-preserving primitive in cryptography. Significant endeavors have been made to address the variant of PIR concerning the malicious servers. Among those endeavors, list-decodable Byzantine robust PIR schemes may tolerate a majority of malicious responding servers that provide incorrect answers. In this paper, we propose two perfect list-decodable BRPIR schemes. Our schemes are the first ones that can simultaneously handle a majority of malicious responding servers, achieve a communication complexity of $o(n^{1/2})$ for a database of size n, and provide a nontrivial estimation on the list sizes. Compared with the existing solutions, our schemes attain lower communication complexity, higher byzantine tolerance, and smaller list size.