Algorithm A1 Secure Multiparty Computation Contract-A

1: Data Reconfiguration     If receive (Mz) //Accept data per data owner     S = M1 + M2 + M3 + ……//Build multi-party computing data S     Return “Successful data construction”     Else “Data build failure” 2: Generate a new S-slice t = 1/2z//MBRRSM multi-party fault tolerance is set to 51%, which means that at least 1/2 of the nodes of the data owner are required.   F(x) = S + a1*x1 + a2*x2 + …. + a(t−1)*x(t−1)mod(u)//Constructing polynomials F(x) If Take z unequal x’s and bring them into F (x) Return z (xi, yi) If Send (xi, yi) ->Pz//Assigned to the data owner P Public u Return Destruction of F(x) 3: Data Sharing If x = 0 Return S If receive (xi, yi) (xi, yi) >=t Return send (xi, yi) ->F(x)//Restore shared non-common data S                                 $F(x)={\displaystyle \sum _{i=1}^{\mathrm{t}}(y_i{\displaystyle \prod _{1\le j\le t,j\ne i}(x-x_j)(}}{\displaystyle \prod _{1\le j\le t,j\ne i}{x}_j-x_i){)}^{-1})\mathrm{mod}(u)}$ Return S