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.
Keywords cryptography - secret sharing schemes - information rate - ideal schemes
Communicated by P. Wild
AMS Classification 94A62