How to avoid the cheaters succeeding in the key sharing scheme (Q1261009): Difference between revisions

The problem of secret sharing involves distributing a set of \(n\) shares \(D_ i\) in such a way that any \(k\) of them suffice to compute the secret \(D\) while less than \(k\) shares is not enough to do so. It may happen, however, that one or more participants in the scheme will try to cheat by providing false share instead of the true one, thus making the result of such collective computation different from the original secret \(D\). It may even happen that such cheater will be later able to recompute the original secret, while the other will be left with the wrong result only. In the article two secret sharing schemes intended to prevent cheating by one or more participants are proposed. One of the schemes proposed just prevents cheating without raising an alarm, the second one allows for detecting attempts to cheat. Both schemes are based on the use of rational interpolation.