Secure Computation

Naho Nakadai, Masahiro Hayashi

This paper analyzes security strength of Iseki & Hayashi's secure computation which is valid for computation of polynomial as for real numbers, and proposes a new method to improve its security strength. First we derive the fact that Iseki & Hayashi's secure computation is deciphered if the value of single input variables of the computation is known. This implies that the security strength of Iseki & Hayashi's secure computation is bounded by the length of bits which can be inputted to this single variable. To improve this bound to be more secured, we propose a technique to repeat steps of Iseki & Hayashi's secure computation until its security strength becomes sufficiently powerful. A simple relationship about security strength between Iseki & Hayashi's secure computation and our proposal is found, and it shows security strength becomes quickly powerful with the increase of number of repetitions. Finally, numerical examples are demonstrated to show the effectiveness of our proposal.

Geoffroy Couteau

Rashid Sheikh, Beerendra Kumar, Durgesh Kumar Mishra

Secure Multi-Party Computation (SMC) allows multiple parties to compute some function of their inputs without disclosing the actual inputs to one another. Secure sum computation is an easily understood example and the component of the various SMC solutions. Secure sum computation allows parties to compute the sum of their individual inputs without disclosing the inputs to one another. In this paper, we propose a modified version of our ck-Secure Sum protocol with more security when a group of the computing parties conspire to know the data of some party.

Silvio M. Micali, Phillip Rogaway

Shafi Goldwasser, Yehuda Lindell

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.