A (t, N) secure sum multiparty computation protocol using multivariate polynomial secret sharing scheme

Abstract

A (t, n) threshold scheme is a method for sharing a secret among n shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. In this paper, we propose a (t, n) secure sum multiparty computation protocol using multivariate polynomial secret sharing scheme. In this scheme, any t or more shareholders acting in collusion can reconstruct the secret, but a particular shareholder’s information is not revealed to other shareholders. This scheme can be applied for authenticating a selected single group of t participants securely without revealing their shares.