Fair (t, n) threshold secret sharing scheme

In the setting of secret sharing, a group of parties wish to run a protocol for recovering the secret when they input their shares. The security requirement include privacy, correctness and others. One desirable property is fairness, which guarantees that if either party gets the secret, then the other party does too. However, basic secret sharing schemes, verifiable secret sharing schemes and publicly verifiable secret sharing schemes do not satisfy the fairness. Moreover, fairness is a central objective of the rational secret sharing scheme. In this work, the authors study the fairness problem of secret reconstruction in a (t, n) secret sharing scheme. They use a new approach to achieve the fairness of the protocol. They first define the fair notion of secret sharing probabilistically. Using the definition, a fair (t, n) secret sharing scheme is proposed, its security and fairness are shown against three different attack types. The proposed scheme is an extension of basic model of secret sharing (Shamir´s scheme) and the approach of fairness of Dov Gordon et al.(STOC2008). Theoretical analysis shows that the proposed scheme is more efficient.