A flaw in the use of minimal defining sets for secret sharing schemes

Grannell, Mike J., Griggs, Terry S. and Street, Anne Penfold (2006) A flaw in the use of minimal defining sets for secret sharing schemes. Design, Codes and Cryptography, 40 2: 225-236. doi:10.1007/s10623-006-0009-3


Author Grannell, Mike J.
Griggs, Terry S.
Street, Anne Penfold
Title A flaw in the use of minimal defining sets for secret sharing schemes
Journal name Design, Codes and Cryptography   Check publisher's open access policy
ISSN 0925-1022
Publication date 2006
Sub-type Article (original research)
DOI 10.1007/s10623-006-0009-3
Volume 40
Issue 2
Start page 225
End page 236
Total pages 12
Editor Dieter Jungnickel
Jennifer D. Key
Peter Wild
Place of publication Dordrecht
Publisher Springer
Collection year 2006
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
230199 Mathematics not elsewhere classified
780101 Mathematical sciences
Abstract 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.
Keyword Block Design
Minimal Defining Set
Secret Sharing
Strongbox
Computer Science, Theory & Methods
Mathematics, Applied
Q-Index Code C1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Access Statistics: 53 Abstract Views  -  Detailed Statistics
Created: Wed, 15 Aug 2007, 09:40:56 EST