On the Capacity of Private Nonlinear Computation for Replicated Databases

We consider the problem of private computation (PC) in a distributed storage system. In such a setting a user wishes to compute a function of f messages replicated across n noncolluding databases, while revealing no information about the desired function to the databases. We provide an information-theoretically accurate achievable PC rate, which is the ratio of the smallest desired amount of information and the total amount of downloaded information, for the scenario of nonlinear computation. For a large message size the rate equals the PC capacity, i.e., the maximum achievable PC rate, when the candidate functions are the f independent messages and one arbitrary nonlinear function of these. When the number of messages grows, the PC rate approaches an outer bound on the PC capacity. As a special case, we consider private monomial computation (PMC) and numerically compare the achievable PMC rate to the outer bound for a finite number of messages.

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

[2]  David A. Karpuk,et al.  Private Polynomial Computation from Lagrange Encoding , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[4]  David A. Karpuk.  Private Computation of Systematically Encoded Data with Colluding Servers , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[5]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

[7]  William Gasarch.  A Survey on Private Information Retrieval , 2004 .

[8]  Jörg Kliewer,et al.  Private Polynomial Computation for Noncolluding Coded Databases , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[9]  Jörg Kliewer,et al.  Capacity of Private Linear Computation for Coded Databases , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[11]  Hua Sun,et al.  The Capacity of Private Computation , 2018, 2018 IEEE International Conference on Communications (ICC).

[12]  Mahtab Mirmohseni,et al.  Private function retrieval , 2017, 2018 Iran Workshop on Communication and Information Theory (IWCIT).

[13]  Jörg Kliewer,et al.  Achievable Rate of Private Function Retrieval from MDS Coded Databases , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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