On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Almost optimum t-cheater identifiable secret sharing schemes
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
| Hi-index | 0.00 |
We consider the problem of k-out-of-n secret sharing, capable of identifying up to t cheaters, with probability at least (1 - ε), for a given error parameter ε. In any such secret sharing scheme, t k/2 and the lower bound of |Vi| ≥ |S| - 1 / ε + 1 holds. Here Vi denotes the set of all possible ith share, that can be assigned to the ith party and S denotes the set of all possible secrets. To the best of our knowledge, there does not exist any computationally efficient secret sharing scheme with k = 2t+1 (the minimum value of k), where |Vi| exactly matches the lower bound. We show that it is possible to match this bound in the amortized sense.