  We consider the problem of secure distributed matrix multiplication (SDMM) in
which a user wishes to compute the product of two matrices with the assistance
of honest but curious servers. We construct polynomial codes for SDMM by
studying a combinatorial problem on a special type of addition table, which we
call the degree table. The codes are based on arithmetic progressions, and are
thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to
outperform all previously known polynomial codes for secure distributed matrix
multiplication in terms of download rate.
