V-fairness (t, n) secret sharing scheme
暂无分享,去创建一个
All secret sharing schemes proposed to date are not really fair on reconstructing a secret since there exists a probability /spl epsiv/, /spl epsiv/>0, such that a dishonest shareholder can obtain the secret while honest ones cannot. The paper proposes a V-fairness (t, n) secret sharing scheme, VFSS scheme, such that all shareholders have an equal probability of obtaining the secret without releasing their shadows simultaneously, even if V, V<t/2, shareholders are dishonest. Furthermore, the cheaters can easily be identified and they have no advantage over other participants during secret reconstruction.
[1] Adi Shamir,et al. How to share a secret , 1979, CACM.
[2] Lein Harn,et al. Fair Reconstruction of a Secret , 1995, Inf. Process. Lett..