CaltechAUTHORS
  A Caltech Library Service

Private Polynomial Computation from Lagrange Encoding

Raviv, Netanel and Karpuk, David A. (2019) Private Polynomial Computation from Lagrange Encoding. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1672-1676. ISBN 9781538692912. https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333160

[img] PDF - Submitted Version
See Usage Policy.

458Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333160

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/isit.2019.8849474DOIArticle
https://arxiv.org/abs/1812.04142arXivDiscussion Paper
ORCID:
AuthorORCID
Raviv, Netanel0000-0002-1686-1994
Karpuk, David A.0000-0003-3621-9752
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.
Record Number:CaltechAUTHORS:20191004-100333160
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333160
Official Citation:N. Raviv and D. A. Karpuk, "Private Polynomial Computation from Lagrange Encoding," 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 1672-1676. doi: 10.1109/ISIT.2019.8849474
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:99078
Collection:CaltechAUTHORS
Deposited By: George Porter
Deposited On:04 Oct 2019 19:41
Last Modified:04 Oct 2019 19:41

Repository Staff Only: item control page