论文信息 - A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes

A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes

It is shown that in some cases it is possible to reconstruct a block design $$\mathcal{D}$$ uniquely from incomplete knowledge of a minimal defining set for $$\mathcal{D}$$. This surprising result has implications for the use of minimal defining sets in secret sharing schemes.

Mike J. Grannell | Terry S. Griggs | Anne Penfold Street

[1] Jennifer Seberry,et al. Further results on strongbox secured secret sharing schemes , 2004 .

[2] Adi Shamir,et al. How to share a secret , 1979, CACM.

[3] Tony Moran. Smallest defining sets for 2-(9, 4, 3) and 3-(10, 5, 3) designs , 1994, Australas. J Comb..

[4] Ken Gray. Further results on smallest defining sets of well known designs , 1990, Australas. J Comb..

[5] Ken Gray. On the minimum number of blocks defining a design , 1990, Bulletin of the Australian Mathematical Society.

[6] D. Stinson,et al. Threshold schemes from combinatorial de - signs , 1989 .

[7] Jennifer Seberry,et al. Strongbox secured secret sharing schemes , 2000 .

[8] Roland Nehl. Robuste Shared Secret Schemes , 1993 .