Secure Multiparty Computation

Valtteri Niemi, Ari Renvall

Han Jiang, Qiuliang Xu

Runhua Shi, Yi Mu, Hong Zhong +2 more

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

Xun Yi, Xuechao Yang, Xiaoning Liu +5 more

Tian You-lian

The fair problem of secure multiparty computation protocol was investigated in the universally composable framework. A fair secure multiparty computation model with ideal functionalities was firstly formulated such as a fair secure multiparty addition computation and a fair secure multiparty multiplicative computation. Next a fair addition computation protocol and a fair multiplicative computation protocol based on the bilinear paring and the ideal functionality of a commitment scheme was proposed. The proposed protocols can securely realize their ideal functionalities in the hybrid model respectively. Finally, analysis show that these schemes are effective, and it can be more applicable in special situation.