Demonstrates improved robustness and low guessing probability in secret sharing schemes, indicating better security.
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.
No takes yet. Share an insight, caveat, or question.
Guenda et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: