Technical Program

Paper Detail

Paper Title A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes
Paper IdentifierTU3.R3.5
Authors Yeow Meng Chee, National University of Singapore, Singapore; Han Mao Kiah, Nanyang Technological University, Singapore; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel; Hui Zhang, Nanyang Technological University, Singapore
Session Private Information Retrieval II
Location Monge, Level 3
Session Time Tuesday, 09 July, 14:30 - 16:10
Presentation Time Tuesday, 09 July, 15:50 - 16:10
Manuscript  Click here to download the manuscript
Abstract Private Information Retrieval (PIR) array codes were introduced by Fazeli et al. (2015) to reduce the storage overhead in designing PIR protocols. Blackburn and Etzion (2017) introduced the (virtual server) rate to quantify the storage overhead of the codes, and when $s>2$ (here, $\frac{1}{s}$ is the proportion of the database storing in one server), they gave a general construction of PIR array codes with the highest rate known so far. In this paper, we generalize their construction and reduce the number of servers, while maintaining the rate. In order to give PIR array codes with significantly fewer servers, we also construct classes of codes with a smaller rate $\frac{s}{2s-1}$.