Secure Multi-party Confidential Protocol of Matrix Factorization

Abstract

The confidential computation of matrix is a very important issue in secure multi-party computation. But there is no literature proposed truly multi-party confidential computation protocol on matrix factorization. In this paper, we use data perturbation assumptions and oblivious transfer protocol to construct a multi-party confidential computation protocol on matrix factorization which has high efficiency.