(t,n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems

A new (t, n) threshold verifiable multisecret sharing ((t, n) VMSS) scheme, based on the intractability of the factorisation and the discrete logarithm modulo a large composite problems, is proposed in which the dealer can freely give any set of multiple secrets for sharing, and the shadow held by the participant is not only reusable but also verifiable. The proposed scheme provides efficient solutions against cheating by either the dealer or a participant, and outperforms (t, n) VMSS schemes against cheating by participants devised by Ham and Chen et al