MDS secret-sharing scheme secure against cheaters
K. Okada, Kaoru Kurosawa · IEEE Transactions on Information Theory · 2000
For the problem of cheaters in secret-sharing schemes, we introduce d/sub cheat/ which is more appropriate than the minimum Hamming distance d/sub min/ of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d/sub min//spl les/d/sub cheat/=n-max/B/spl notin//spl Gamma/|B| where /spl Gamma/ denotes the access structure.