STR: Secure Computation on Additive Shares Using the Share-Transform-Reveal Strategy
Zhihua Xia, Qi Gu, Wenhao Zhou, Lizhi Xiong, Jian Weng, Naixue Xiong
Abstract
The rapid development of cloud computing probably benefits many of us while the privacy risks brought by semi-honest cloud servers have aroused the attention of more and more people and legislatures. In the last two decades, plenty of works seek to outsource various specific tasks to servers while ensuring the security of private data. The tasks to be outsourced are countless; however, the computations involved are similar. In this article, we construct a series of novel protocols that support the secure computation of various functions on numbers (e.g., the basic elementary functions) and matrices (e.g., the calculation of eigenvectors and eigenvalues) on arbitrary <inline-formula><tex-math notation="LaTeX">$n\geq 2$</tex-math></inline-formula> servers. All protocols only require constant rounds of interactions and achieve low computation complexity. Moreover, the proposed <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula> -party protocols ensure the security of private data even though <inline-formula><tex-math notation="LaTeX">$n-1$</tex-math></inline-formula> servers collude. The convolutional neural network models are utilized as the case studies to verify the protocols. The theoretical analysis and experimental results demonstrate the correctness, efficiency, and security of the proposed protocols.