Private Polynomial Computation from Lagrange Encoding
- Creators
- Raviv, Netanel
- Karpuk, David A.
Abstract
Private computation is a generalization of private information retrieval, in which a user is able to compute a function on a distributed dataset without revealing the identity of that function to the servers that store the dataset. In this paper it is shown that Lagrange encoding, a recently suggested powerful technique for encoding Reed-Solomon codes, enables private computation in many cases of interest. In particular, we present a scheme that enables private computation of polynomials of any degree on Lagrange encoded data, while being robust to Byzantine and straggling servers, and to servers that collude in attempt to deduce the identities of the functions to be evaluated. Moreover, incorporating ideas from the well-known Shamir secret sharing scheme allows the data itself to be concealed from the servers as well. Our results extend private computation to non-linear polynomials and to data-privacy, and reveal a tight connection between private computation and coded computation.
Additional Information
© 2019 IEEE. The first author would like to thank Prof. Jehoshua Bruck for many helpful discussions. The second author would like to thank Razane Tajeddine and Oliver Gnilke for constructive and helpful conversations regarding the results of the current work.Attached Files
Submitted - 1812.04142.pdf
Files
Name | Size | Download all |
---|---|---|
md5:688b6f770367b8192a3950b7d730f38f
|
469.8 kB | Preview Download |
Additional details
- Eprint ID
- 99078
- Resolver ID
- CaltechAUTHORS:20191004-100333160
- Created
-
2019-10-04Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field