Subset Sum-Based Verifiable Secret Sharing Scheme for Secure Multiparty Computation

Despite the information theoretic security of Shamir Secret Sharing Scheme and the ideality of Verifiable Secret Sharing Scheme in ensuring the honesty of a dealer of the shared secret and the shared secret itself, the detection and removal of an adversary posing as shareholder is still an open problem due to the fact that most of the studies are computationally and communicationally complex. This paper proposes a verifiable secret sharing scheme using a simple subset sum theory in monitoring and removing compromised shareholder in a secure multiparty computation. An analysis shows that the scheme cost minimal computational complexity of O(n) on the worst-case scenario and a variable-length communication cost depending on the length of the subset and the value of n.