We develop a new secret sharing scheme based on the decomposition of irreducible polynomials as a composed product of irreducible polynomials. We study its perfect secrecy, robustness, and cost. Further, we compare the guessing probability for our scheme and other secret sharing schemes. The results show that the proposed scheme has superior robustness and a low guessing probability despite significant leakage.
Guenda et al. (Thu,) studied this question.