  We consider the problem of secure distributed matrix multiplication in which
a user wishes to compute the product of two matrices with the assistance of
honest but curious servers. We show how to construct polynomial schemes for the
outer product partitioning which take advantage of the user's ability to
precompute, and provide bounds for our technique. We show that precomputation
allows for a reduction in the order of the time complexity for the cases where
the number of colluding servers is a fixed percentage of the number of servers.
Furthermore, with precomputation, any percentage (less than 100%) of collusions
can be tolerated, compared to the upper limit of 50% for the case without
precomputation.
