Combinatorial models for perfect secret sharing schemes
Wen‐Ai Jackson, Keith M. Martin · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · 1998
In this paper we review combinatorial models for secret sharing schemes A detailed comparison of several existing combinatorial models for secret sharing sharing schemes is conducted We pay par ticular attention to the ideal instances of these combinatorial models We show that the models under examination have a natural hierarchy but that the ideal instances of these models have a di erent hierar chy We show that in the ideal case the combinatorial structures underlying the combinatorial models are essentially independent of the model being used Further we show that the matroid associated with an ideal scheme is uniquely determined by the access structure of the scheme and is independent of the model being used We use this result to present a combinatorial classi cation of ideal threshold schemes