Private Function Computation for Noncolluding Coded Databases

03/22/2020
by   Sarah A. Obead, et al.
0

Private computation in a distributed storage system (DSS) is a generalization of the private information retrieval (PIR) problem. In such setting a user wishes to compute a function of f messages stored in noncolluding coded databases while revealing no information about the desired function to the databases. We consider the problem of private polynomial computation (PPC). In PPC, a user wishes to compute a multivariate polynomial of degree at most g over f variables (or messages) stored in multiple databases. First, we consider the private computation of polynomials of degree g=1, i.e., private linear computation (PLC) for coded databases. In PLC, a user wishes to compute a linear combination over the f messages while keeping the coefficients of the desired linear combination hidden from the database. For a linearly encoded DSS, we present a capacity-achieving PLC scheme and show that the PLC capacity, which is the ratio of the desired amount of information and the total amount of downloaded information, matches the maximum distance separable coded capacity of PIR for a large class of linear storage codes. Then, we consider private computation of higher degree polynomials, i.e., g>1. For this setup, we construct two novel PPC schemes. In the first scheme we consider Reed-Solomon coded databases with Lagrange encoding, which leverages ideas from recently proposed star-product PIR 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 asymptotically, as f→∞, the systematic scheme gives a significantly better computation rate compared to all known schemes up to some storage code rate that depends on the maximum degree of the candidate polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2019

Private Polynomial Computation for Noncolluding Coded Databases

We consider private polynomial computation (PPC) over noncolluding coded...
research
10/09/2018

Capacity of Private Linear Computation for Coded Databases

We consider the problem of private linear computation (PLC) in a distrib...
research
01/07/2018

Private Computation of Systematically Encoded Data with Colluding Servers

Private Computation (PC), recently introduced by Sun and Jafar, is a gen...
research
01/17/2020

On the Capacity of Private Monomial Computation

In this work, we consider private monomial computation (PMC) for replica...
research
07/04/2023

On the Capacity of Private Nonlinear Computation for Replicated Databases

We consider the problem of private computation (PC) in a distributed sto...
research
10/19/2020

Symmetric Private Polynomial Computation From Lagrange Encoding

The problem of X-secure T-colluding symmetric Private Polynomial Computa...
research
12/31/2018

Private Information Retrieval from Non-Replicated Databases

We consider the problem of private information retrieval (PIR) of a sing...

Please sign up or login with your details

Forgot password? Click here to reset