Uncoded Placement With Linear Sub-Messages for Private Information Retrieval From Storage Constrained Databases

• Published in: IEEE transactions on communications Vol. 68; no. 10; pp. 6039 - 6053
• Main Authors: Woolsey, Nicholas, Chen, Rong-Rong, Ji, Mingyue
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Constraints; Downloading; heterogeneous storage sizes; Infimum; Information retrieval; Iterative algorithms; Iterative methods; Libraries; Messages; Placement; Privacy; Private information retrieval (PIR); Radio frequency; storage-constrained databases; Zinc
• ISSN: 0090-6778; 1558-0857
• DOI: 10.1109/TCOMM.2020.3010988

We propose capacity-achieving schemes for private information retrieval (PIR) from uncoded databases (DBs) with both homogeneous and heterogeneous storage constraints. In the PIR setting, a user queries a set of DBs to privately download a message, where privacy implies that no one DB can infer which message the user desires. In general, a PIR scheme is comprised of storage placement and delivery designs. Previous works have derived the capacity, or infimum download cost, of PIR with uncoded storage placement and sufficient conditions of storage placement to meet capacity. However, the currently proposed storage placement designs require splitting each message into an exponential number of sub-messages with respect to the number of DBs. In this work, when DBs have the same storage constraint, we propose two simple storage placement designs that satisfy the capacity conditions. Then, for more general heterogeneous storage constraints, we translate the storage placement design process into a "filling problem". We design an iterative algorithm to solve the filling problem where, in each iteration, messages are partitioned into sub-messages and stored at subsets of DBs. All of our proposed storage placement designs require a number of sub-messages per message at most equal to the number of DBs.