Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Field Trace Polynomial Codes for Secure Distributed Matrix
  Multiplication   We consider the problem of communication efficient secure distributed matrix
multiplication. The previous literature has focused on reducing the number of
servers as a proxy for minimizing communication costs. The intuition being,
that the more servers used, the higher the communication cost. We show that
this is not the case. Our central technique relies on adapting results from the
literature on repairing Reed-Solomon codes where instead of downloading the
whole of the computing task, a user downloads field traces of these
computations. We present field trace polynomial codes, a family of codes, that
explore this technique and characterize regimes for which our codes outperform
the existing codes in the literature.

7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th