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 D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implications for the use of minimal defining sets in secret sharing schemes. AMS classifications: Primary: 94A62, Secondary: 05B05.

• Type: Conference
• Year: 2006
• Where: DCC
• Authors: Mike J. Grannell, Terry S. Griggs, Anne Penfold Street
• Keywords: AMS Classifications, Computer Graphics, DCC 2006, Minimal Defining Sets, Secret Sharing Schemes