Symmetric Private Polynomial Computation From Lagrange Encoding

10/19/2020
by   Jinbao Zhu, et al.
0

The problem of X-secure T-colluding symmetric Private Polynomial Computation (PPC) from coded storage system with B Byzantine and U unresponsive servers is studied in this paper. Specifically, a dataset consisting of M files are stored across N distributed servers according to (N,K+X) Maximum Distance Separable (MDS) codes such that any group of up to X colluding servers can not learn anything about the data files. A user wishes to privately evaluate one out of a set of candidate polynomial functions over the M files from the system, while guaranteeing that any T colluding servers can not learn anything about the identity of the desired function and the user can not learn anything about the M data files more than the desired polynomial function, in the presence of B Byzantine servers that can send arbitrary responses maliciously to confuse the user and U unresponsive servers that will not respond any information at all. Two novel symmetric PPC schemes using Lagrange encoding are proposed. Both the two schemes achieve the same PPC rate 1-G(K+X-1)+T+2B/N-U, secrecy rate G(K+X-1)+T/N-(G(K+X-1)+T+2B+U), finite field size and decoding complexity, where G is the maximum degree over all the candidate polynomial functions. Particularly, the first scheme focuses on the general case that the candidate functions are consisted of arbitrary polynomials, and the second scheme restricts the candidate functions to be a finite-dimensional vector space (or sub-space) of polynomials over 𝔽_p but requires less upload cost, query complexity and server computation complexity. Remarkably, the PPC setup studied in this paper generalizes all the previous MDS coded PPC setups and the two degraded schemes strictly outperform the best known schemes in terms of (asymptotical) PPC rate, which is the main concern of the PPC schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2021

Multi-User Blind Symmetric Private Information Retrieval from Coded Servers

The problem of Multi-user Blind X-secure T-colluding Symmetric Private I...
research
12/10/2018

Private Polynomial Computation from Lagrange Encoding

Private computation is a generalization of private information retrieval...
research
08/28/2019

X-secure T-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers

The problem of X-secure T-private information retrieval from MDS coded s...
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/09/2019

Private Information Retrieval from Locally Repairable Databases with Colluding Servers

In this work, information-theoretical private information retrieval (PIR...
research
06/22/2022

Multi-User Linearly-Separable Distributed Computing

In this work, we explore the problem of multi-user linearly-separable di...
research
03/22/2020

Private Function Computation for Noncolluding Coded Databases

Private computation in a distributed storage system (DSS) is a generaliz...

Please sign up or login with your details

Forgot password? Click here to reset