Weakly-Private Information Retrieval

Private information retrieval (PIR) protocols make it possible to retrieve a file from a database without disclosing any information about the identity of the file being retrieved. These protocols have been rigorously explored from an information-theoretic perspective in recent years. While existing protocols strictly impose that no information is leaked on the file’s identity, this work initiates the study of the tradeoffs that can be achieved by relaxing the requirement of perfect privacy. In case the user is willing to leak some information on the identity of the retrieved file, we study how the PIR rate, as well as the upload cost and access complexity, can be improved. For the particular case of replicated servers, we propose two weakly-private information retrieval schemes based on two recent PIR protocols and a family of schemes based on partitioning. Lastly, we compare the performance of the proposed schemes.

[1]  David A. Basin,et al.  An information-theoretic model for adaptive side-channel attacks , 2007, CCS '07.

[2]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2017, IEEE Transactions on Information Theory.

[3]  Zeev Dvir,et al.  2-Server PIR with Subpolynomial Communication , 2016, J. ACM.

[4]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[5]  David Eckhoff,et al.  Metrics : a Systematic Survey , 2018 .

[6]  Salim El Rouayheb,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2016, IEEE Transactions on Information Theory.

[7]  Hsuan-Yin Lin,et al.  Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes , 2017, IEEE Transactions on Information Theory.

[8]  Swanand Kadhe,et al.  Private information retrieval with side information: The single server case , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Eitan Yaakobi,et al.  PIR with Low Storage Overhead: Coding instead of Replication , 2015, ArXiv.

[10]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval From Coded Databases , 2016, IEEE Transactions on Information Theory.

[11]  Eitan Yaakobi,et al.  On the Access Complexity of PIR Schemes , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[12]  Hua Sun,et al.  The Capacity of Robust Private Information Retrieval With Colluding Databases , 2016, IEEE Transactions on Information Theory.

[13]  Eitan Yaakobi,et al.  Codes for distributed PIR with low storage overhead , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[14]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost , 2018, IEEE Transactions on Information Theory.

[15]  Hirosuke Yamamoto,et al.  Private information retrieval for coded storage , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  Yuval Ishai,et al.  Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Alexandre Graell i Amat,et al.  Private information retrieval in distributed storage systems using an arbitrary linear code , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[18]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[19]  George Danezis,et al.  Lower-Cost ∈-Private Information Retrieval , 2016, Proc. Priv. Enhancing Technol..