[Resource Topic] 2002/050: Secret sharing schemes with three or four minimal qualified subsets

Welcome to the resource topic for 2002/050

Title:
Secret sharing schemes with three or four minimal qualified subsets

Authors: Jaume Martí-Farré, Carles Padró

Abstract:

In this paper we study secret sharing schemes whose access structure
has three or four minimal qualified subsets. The ideal case is
completely characterized and for the non-ideal case
we provide bounds on the optimal information rate.

ePrint: https://eprint.iacr.org/2002/050

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .