Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs

ePrint Report: Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs

Amos Beimel

A secret-sharing scheme enables a dealer, holding a secret string, to distribute shares to parties such that only pre-defined authorized subsets of parties can reconstruct the secret. The collection of authorized sets is called an access structure. There is a huge gap between the best known upper-bounds on the share size of a secret-sharing scheme realizing an arbitrary access structure and the best known lower-bounds on the size of these …

access amos called collection defined eprint report gap report secret share sharing size