A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters
- Cite this paper as:
- Tso R., Miao Y., Okamoto E. (2004) A New Algorithm for Searching a Consistent Set of Shares in a Threshold Scheme with Cheaters. In: Lim JI., Lee DH. (eds) Information Security and Cryptology - ICISC 2003. ICISC 2003. Lecture Notes in Computer Science, vol 2971. Springer, Berlin, Heidelberg
In a (k,n) Shamir’s threshold scheme, if one or more of the n shares are fake, then the secret may not be reconstructed correctly by some sets of k shares. Supposing that at most t of the n shares are fake, Rees et al. (1999) described two algorithms to determine consistent sets of shares so that the secret can be reconstructed correctly from k shares in any of these consistent sets. In their algorithms, no honest participant can be absent and at least n-t shares should be pooled during the secret reconstruction phase. In this paper, we propose a modified algorithm for this problem so that the number of participants taking part in the secret reconstruction can be reduced to k+2t and the shares need to be pooled can be reduced to, in the best case, k+t, and less than or equal to k+2t in the others. Its efficiency is also investigated.
Unable to display preview. Download preview PDF.