Multi-Server Weakly-Private Information Retrieval

Private information retrieval (PIR) protocols ensure that a user can download a file from a database without revealing any information on the identity of the requested file to the servers storing the database. 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 perfect privacy requirement. We refer to such protocols as weakly-private information retrieval (WPIR) protocols. In particular, for the case of multiple noncolluding replicated servers, we study how the download rate, the upload cost, and the access complexity can be improved when relaxing the perfect privacy constraint. To quantify the information leakage on the requested file’s identity we consider mutual information (MI), worst-case information leakage, and maximal leakage (MaxL). We present two WPIR schemes, denoted by Scheme A and Scheme B, based on two recent PIR protocols and show that the download rate of the former can be optimized by solving a convex optimization problem. We also show that Scheme A achieves an improved download rate compared to the recently proposed scheme by Samy et al. under the so-called $\epsilon $ -privacy metric. Additionally, a family of schemes based on partitioning is presented. Moreover, we provide an information-theoretic converse bound for the maximum possible download rate for the MI and MaxL privacy metrics under a practical restriction on the alphabet size of queries and answers. For two servers and two files, the bound is tight under the MaxL metric, which settles the WPIR capacity in this particular case. Finally, we compare the performance of the proposed schemes and their gap to the converse bound.

[1]  Hua Sun,et al.  Multiround Private Information Retrieval: Capacity and Storage Overhead , 2016, IEEE Transactions on Information Theory.

[2]  Eitan Yaakobi,et al.  Bounds on the Length of Functional PIR and Batch Codes , 2020, IEEE Transactions on Information Theory.

[3]  H. Vincent Poor,et al.  Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach , 2011, IEEE Transactions on Information Forensics and Security.

[4]  Swanand Kadhe,et al.  Private Information Retrieval With Side Information , 2017, IEEE Transactions on Information Theory.

[5]  Geoffrey Smith,et al.  On the Foundations of Quantitative Information Flow , 2009, FoSSaCS.

[6]  Chao Tian,et al.  A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[7]  Stephen P. Boyd,et al.  CVXPY: A Python-Embedded Modeling Language for Convex Optimization , 2016, J. Mach. Learn. Res..

[8]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

[9]  Raymond W. Yeung,et al.  The Interplay Between Entropy and Variational Distance , 2010, IEEE Trans. Inf. Theory.

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

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

[12]  Sudeep Kamath,et al.  An Operational Approach to Information Leakage , 2018, IEEE Transactions on Information Theory.

[13]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[14]  Gilles Barthe,et al.  Information-Theoretic Bounds for Differentially Private Mechanisms , 2011, 2011 IEEE 24th Computer Security Foundations Symposium.

[15]  Johann-Christoph Freytag,et al.  Repudiative information retrieval , 2002, WPES '02.

[16]  Sennur Ulukus,et al.  Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes , 2017, IEEE Transactions on Information Theory.

[17]  Sofya Raskhodnikova,et al.  What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Syed Ali Jafar,et al.  On the Asymptotic Capacity of X-Secure T-Private Information Retrieval With Graph-Based Replicated Storage , 2019, IEEE Transactions on Information Theory.

[19]  Salim El Rouayheb,et al.  One-Shot PIR: Refinement and Lifting , 2018, IEEE Transactions on Information Theory.

[20]  Stefan M. Moser,et al.  Advanced Topics in Information Theory: Lecture Notes , 2018 .

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

[22]  Wonjae Shin,et al.  Private Information Retrieval for Secure Distributed Storage Systems , 2018, IEEE Transactions on Information Forensics and Security.

[23]  Camilla Hollanti,et al.  $t$ -Private Information Retrieval Schemes Using Transitive Codes , 2017, IEEE Transactions on Information Theory.

[24]  Syed A. Jafar,et al.  X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers , 2019, IEEE Transactions on Information Theory.

[25]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[26]  Michael Gastpar,et al.  Single-server Multi-user Private Information Retrieval with Side Information , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[27]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[28]  Mikael Skoglund,et al.  Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers , 2019, IEEE Transactions on Information Theory.

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

[30]  Kannan Ramchandran,et al.  One extra bit of download ensures perfectly private information retrieval , 2014, 2014 IEEE International Symposium on Information Theory.

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

[32]  Zhen Lin,et al.  Using binning to maintain confidentiality of medical data , 2002, AMIA.

[33]  Stephen Boyd,et al.  A Rewriting System for Convex Optimization Problems , 2017, ArXiv.

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

[35]  Xiaohu Tang,et al.  A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers , 2019, IEEE Transactions on Information Forensics and Security.

[36]  Loukas Lazos,et al.  On the Capacity of Leaky Private Information Retrieval , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[37]  Hua Sun,et al.  Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval , 2018, IEEE Transactions on Information Theory.

[38]  Chao Tian,et al.  Weakly Private Information Retrieval Under the Maximal Leakage Metric , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[39]  Zhengmin Zhang,et al.  Estimating Mutual Information Via Kolmogorov Distance , 2007, IEEE Transactions on Information Theory.

[40]  Martin J. Wainwright,et al.  Local privacy and statistical minimax rates , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[42]  Camilla Hollanti,et al.  Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers , 2018, IEEE Transactions on Information Theory.

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

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

[45]  Chao Tian,et al.  Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding , 2019, Inf..

[46]  Alexandre Graell i Amat,et al.  Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage , 2018, 2018 IEEE Information Theory Workshop (ITW).

[47]  Eitan Yaakobi,et al.  The Capacity of Single-Server Weakly-Private Information Retrieval , 2020, IEEE Journal on Selected Areas in Information Theory.

[48]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval With Partially Known Private Side Information , 2019, IEEE Transactions on Information Theory.

[49]  Raymond W. Yeung,et al.  The Interplay Between Entropy and Variational Distance , 2007, IEEE Transactions on Information Theory.

[50]  Fatemeh Kazemi,et al.  The Role of Coded Side Information in Single-Server Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

[51]  Chao Tian,et al.  On the Storage Cost of Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

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

[53]  Syed Ali Jafar,et al.  The Capacity of Private Information Retrieval with Private Side Information , 2017, ArXiv.

[54]  Hua Sun,et al.  Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length , 2016, IEEE Transactions on Information Forensics and Security.

[55]  Camilla Hollanti,et al.  Private Information Retrieval from Coded Databases with Colluding Servers , 2016, SIAM J. Appl. Algebra Geom..

[56]  Syed Ali Jafar,et al.  The Asymptotic Capacity of Private Search , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[57]  Paul W. Cuff,et al.  Differential Privacy as a Mutual Information Constraint , 2016, CCS.

[58]  Sennur Ulukus,et al.  Fundamental Limits of Cache-Aided Private Information Retrieval With Unknown and Uncoded Prefetching , 2017, IEEE Transactions on Information Theory.

[59]  Itzhak Tamo,et al.  Private Information Retrieval is Graph Based Replication Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[60]  Loukas Lazos,et al.  Latent-variable Private Information Retrieval , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[61]  Ravi Tandon,et al.  The capacity of cache aided private information retrieval , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[63]  Eitan Yaakobi,et al.  Private Proximity Retrieval Codes , 2019, IEEE Transactions on Information Theory.

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

[65]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval from Byzantine and Colluding Databases , 2017, IEEE Transactions on Information Theory.

[66]  Henry Corrigan-Gibbs,et al.  Private Information Retrieval with Sublinear Online Time , 2020, IACR Cryptol. ePrint Arch..

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

[68]  Ruida Zhou,et al.  On the Information Leakage in Private Information Retrieval Systems , 2020, IEEE Transactions on Information Forensics and Security.

[69]  Loukas Lazos,et al.  Asymmetric Leaky Private Information Retrieval , 2020, IEEE Transactions on Information Theory.

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

[71]  Towards Practical Private Information Retrieval From MDS Array Codes , 2020, IEEE Transactions on Communications.

[72]  G. Crooks.  On Measures of Entropy and Information , 2015 .

[73]  Karim A. Banawan,et al.  Semantic Private Information Retrieval: Effects of Heterogeneous Message Sizes and Popularities , 2020, GLOBECOM 2020 - 2020 IEEE Global Communications Conference.

[74]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[75]  Eitan Yaakobi,et al.  Bounds on the Length of Functional PIR and Batch Codes , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[76]  Mikael Skoglund,et al.  On PIR and Symmetric PIR From Colluding Databases With Adversaries and Eavesdroppers , 2019, IEEE Transactions on Information Theory.

[77]  Camilla Hollanti,et al.  Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers. , 2020 .

[78]  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..

[79]  Camilla Hollanti,et al.  Private Information Retrieval Schemes With Product-Matrix MBR Codes , 2021, IEEE Transactions on Information Forensics and Security.