A flaw in the use of minimal defining sets for secret sharing schemes
| Contribuinte(s) |
Dieter Jungnickel Jennifer D. Key Peter Wild |
|---|---|
| Data(s) |
01/01/2006
|
| Resumo |
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. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Palavras-Chave | #Block Design #Minimal Defining Set #Secret Sharing #Strongbox #Computer Science, Theory & Methods #Mathematics, Applied #C1 #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics #230199 Mathematics not elsewhere classified #780101 Mathematical sciences |
| Tipo |
Journal Article |
