Improved Polynomial Secret-Sharing Schemes

ePrint Report: Improved Polynomial Secret-Sharing Schemes

Amos Beimel, Oriol Farràs, Or Lasri

Despite active research on secret-sharing schemes for arbitrary access structures for more than 35 years, we do not understand their share size $-$ the best known upper bound for an arbitrary n-party access structure is $2^{O(n)}$ while the best known lower bound is $\Omega(n/\log(n))$. Consistent with our knowledge, the share size can be anywhere between these bounds. To better understand this question, one can study specific families of …

access amos eprint report log omega party report research secret share sharing size understand