Jun 22, 1994 · In this paper we consider the problem of identifying cheaters in secret sharing schemes. Rabin and Ben-Or presented a perfect and ...
In Tompa and Woll's scheme the probability that the k - 1 cheaters cheat successfully is at most 1 - k ~. However, even though participants can detect when.
People also ask
What is the best secret sharing scheme?
What is threshold secret sharing?
What is the secret sharing technique?
What is a linear secret sharing scheme?
A perfect threshold secret sharing scheme to identify cheaters (1995 ...
typeset.io › Paper Directory
Rabin and Ben-Or presented a perfect and unconditionally secure secret sharing scheme in which the honest participants are able to identify the cheaters. We ...
[PDF] Threshold Secret Sharing Scheme with Efficient Cheater Identifying
inria.hal.science › document
Mar 26, 2021 · In 2016, Liu[11] presented a Linear (t, n)-threshold secret sharing scheme in which there is only one honest participant can detect cheaters.
Missing: Perfect | Show results with:Perfect
The scheme consists of three protocols which correspond to the secret distribution phase, secret reconstruction phase, and cheater identification phase ...
Jan 7, 2018 · I want to prove formally that neither of the 2 honest participants can detect who is the cheater. My current lead is this: in the revealing ...
The authors mentioned that the security can be enhanced by designing the secret sharing scheme with cheating detection and cheater identification [22] ...
The new scheme can identify the cheaters no matter if she/he is the original secret image holder or the participant; because each participant chooses her/his ...
Missing: Perfect | Show results with:Perfect
A perfect threshold secret sharing scheme to identify cheaters. Designs ... t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes. Advances in ...
Aug 15, 2014 · However, all these schemes can only detect cheating, without identifying the exact identity of the cheaters, who submitted incorrect shares.