Private Polynomial Computation for Noncolluding Coded Databases

We consider private polynomial computation (PPC) over noncolluding coded databases. In such a setting a user wishes to compute a multivariate polynomial of degree at most g over f variables (or messages) stored in multiple databases while revealing no information about the desired polynomial to the databases. We construct two novel PPC schemes, where the first is a generalization of our previous work in private linear computation for coded databases. In this scheme we consider Reed-Solomon coded databases with Lagrange encoding, which leverages ideas from recently proposed star-product private information retrieval and Lagrange coded computation. The second scheme considers the special case of coded databases with systematic Lagrange encoding. Both schemes yield improved rates compared to the best known schemes from the literature for a small number of messages, while in the asymptotic case the rates match.

[1]  Salim El Rouayheb,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 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]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2017, IEEE Transactions on Information Theory.

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

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

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

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

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

[9]  Amir Salman Avestimehr,et al.  Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy , 2018, AISTATS.

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

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

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

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

[14]  Salim El Rouayheb,et al.  Lifting Private Information Retrieval from Two to any Number of Messages , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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