Practical SS-MPC for collusion whole

Secret sharing (SS) technology is widely used in multi-party computation (MPC) because of its simple secret structure and low computational overhead. Aiming at solving the problem that the existing SS-MPC scheme cannot solve the collusion of all computing parties to recover the original data, this work designs a practical SS-MPC for collusion whole (PSCW) scheme. Through the negotiation of redundant computing nodes and redundant security parameters between computing parties, PSCW scheme can ensure that original data cannot be recovered even if all computing nodes collude to obtain all secret shares, which guarantees the confidentiality of the scheme. At the same time, with the addition of redundant computing nodes, PSCW scheme can correctly realize computing requirements of users and ensure the correctness of the calculation results. Compared with the existing SS-MPC scheme, PSCW scheme has higher security and higher application value in real scenes.