📝 SummarXiv

Abstract

We study the problem of low-bandwidth non-linear computation on Reed-Solomon encoded data. Given an $[n,k]$ Reed-Solomon encoding of a message vector $\mathbf{f} \in \mathbb{F}_q^k$, and a polynomial $g \in \mathbb{F}_q[X_1, X_2, \ldots, X_k]$, a user wishing to evaluate $g(\mathbf{f})$ is given local query access to each codeword symbol. The query response is allowed to be the output of an arbitrary function evaluated locally on the codeword symbol, and the user's aim is to minimize the total information downloaded in order to compute $g(\mathbf{f})$. This problem has been studied before for \emph{linear} functions $g$; in this work we initiate the study of non-linear functions by starting with quadratic monomials. For $q = p^e$ and distinct $i,j \in [k]$, we show that any scheme evaluating the quadratic monomial $g_{i,j} := X_i X_j$ must download at least $2 \log_2(q-1) - 3$ bits of information when $p$ is an odd prime, and at least $2\log_2(q-2) -4$ bits when $p=2$. When $k=2$, our result shows that one cannot do significantly better than the naive bound of $k \log_2(q)$ bits, which is enough to recover all of $\mathbf{f}$. This contrasts sharply with prior work for low-bandwidth evaluation of \emph{linear} functions $g(\mathbf{f})$ over Reed-Solomon encoded data, for which prior work has shown it is possible to substantially improve upon this bound.