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. Designs, Codes and Cryptography, 40(2), pp. 225–236.

URL:	http://mcs.open.ac.uk/mjg47/Papers/mdefb.pdf
DOI (Digital Object Identifier) Link:	http://dx.doi.org/doi:10.1007/s10623-006-0009-3
Google Scholar:	Look up in Google Scholar

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.

Item Type:	Journal Article
ISSN:	1573-7586
Keywords:	block design; minimal defining set; secret sharing; strongbox
Academic Unit/Department:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	6948
Depositing User:	Mike Grannell
Date Deposited:	20 Feb 2007
Last Modified:	02 Dec 2010 19:57
URI:	http://oro.open.ac.uk/id/eprint/6948

Actions (login may be required)

	View Item
RDF+XMLBibTeXRDF+N-TriplesJSONDublin CoreAtomOAI-ORE Resource Map (Atom Format)Simple MetadataReferMETSOAI-ORE Resource Map (RDF Format)HTML CitationASCII CitationMultiline CSVRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3Eprints Application Profile	Public: Report issue / request change