Simple and Asymptotically Optimal t-Cheater Identifiable Secret Sharing Scheme.
Ashish Choudhury · 2011
Abstract. In this paper, we consider the problem of k-out-of-n secret sharing scheme, capable of identifying t cheaters. We design a very simple k-out-of-n secret sharing scheme, which can identify up to t cheaters, with probability at least 1 − ϵ, where 0 < ϵ < 1/2, provided t < k/2. This is the maximum number of cheaters, which can be identified by any k-out-of-n secret sharing scheme, capable of identifying t cheaters 1. In our scheme, the set of all possible i th share Vi satisfies the condition that |Vi | = |S|/ϵ 3n, where S denotes the set of all possible secrets. Moreover, our scheme requires polynomial computation. In EUROCRYPT 2011, Satoshi Obana presented two SSCI schemes, which can identify up to t < k/2 cheaters. However, the schemes require