2019 IEEE International Symposium on Information Theory (ISIT) | 2019

Private Secure Coded Computation

 
 

Abstract


We introduce a variation of coded computation that protects the data security and the master’s privacy against the workers, which is referred to as private secure coded computation. In private secure coded computation, the master needs to compute a function of its own dataset and one of the datasets in a library exclusively shared by the external workers. After recovering the desired function, the workers should not know which dataset in the library was desired by the master or obtain any information about the master’s own data. We propose a private secure coded computation scheme for matrix multiplication, namely private secure polynomial codes, based on private polynomial codes for private coded computation. By simulation, we show that the private secure polynomial codes achieves better computation time than private polynomial codes modified for private secure coded computation.

Volume None
Pages 1097-1101
DOI 10.1109/ISIT.2019.8849252
Language English
Journal 2019 IEEE International Symposium on Information Theory (ISIT)

Full Text