A simple (v, t, n)-fairness secret sharing scheme with one shadow for each participant
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
Hi-index | 0.00 |
An efficient (v, r, n)-fairness secret sharing scheme isproposed in this paper. In the proposed scheme, all participantshave an equal probability to recover the sharedsecret, even if there exist v cheaters, v