Scheme of Whole Detecting Cheaters in Threshold Secret Sharing
Wenxing Chen · Jisuanji gongcheng · 2009
So far,methods of whole detecting cheaters in threshold secret sharing are few.If another participant can join in the t participants,t+1 participants in total,according to the scheme proposed in this paper,the existence of cheaters can be checked out only calculating equations once,requiring no other information.This scheme is a perfect sharing scheme.Its information rate is 1.The probability of one cheater's success is 0 and it is less than 1/p(where p is a large prime) for two or three cheaters in probability of success.