Secure multi-party computation problems and their applications

Wenliang Kevin Du, Zhijun Zhan

Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Luo Wen

Wenliang Du has been studied some secure two-party scientific computation problems [4] : Linear systems of equations problems, Linear least squares problems and Linear programming problems. And he point to: (1)There are some other interesting scientific computation problems that need to be studied, such as how secure compute eigenvalues of matrix. (2)Extension to the secure multi-party computation problem, and thought extension secure two-party computation protocols to the secure multi-party computation protocols is not trivial. In this paper, authors disscuss two scientific computation problems: eigenvalues of matrix in secure multi-party computation situation, and give some secure multi-party scientific computation protocols.

Chuan Zhao, Shengnan Zhao, Minghao Zhao +4 more

Daniel Tschudi

Liu Wen, Yongbin Wang

The secure multi-party comparing problem is generalized from the millionaires' problem,which is used to get whether the multi-party's secret inputs are all equal and if not,the number of users whose inputs are same as an indicated user's.Based on the F function and semantic addition homomorphic encryption,a protocol of secure multi-party comparing is proposed.The correctness,security and efficiency of the protocol are analyzed.This protocol can be used in many aspects of secure multi-party computation.