An optimal multisecret threshold scheme construction

Simple item page
dc.contributor.authorBarwick, S.
dc.contributor.authorJackson, W.
dc.date.issued2005
dc.descriptionThe original publication can be found at www.springerlink.com
dc.description.abstractA multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret sK associated with every subset K of k participants such that any t participants in K can reconstruct the secret sK, but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information.
dc.description.statementofresponsibilityS. G. Barwick and Wen-Ai Jackson
dc.identifier.citationDesigns, Codes, and Cryptography, 2005; 37(3):367-389
dc.identifier.doi10.1007/s10623-004-4031-z
dc.identifier.issn0925-1022
dc.identifier.issn1573-7586
dc.identifier.orcidBarwick, S. [0000-0001-9492-0323]
dc.identifier.orcidJackson, W. [0000-0002-0894-0916]
dc.identifier.urihttp://hdl.handle.net/2440/17772
dc.language.isoen
dc.publisherKluwer Academic Publ
dc.source.urihttp://www.springerlink.com/content/b647044l00024832/
dc.subjectSecret sharing schemes, multisecret schemes, geometrical construction
dc.titleAn optimal multisecret threshold scheme construction
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Pure Mathematics publications