Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarwick, S.-
dc.contributor.authorJackson, W.-
dc.identifier.citationDesigns, Codes and Cryptography, 2005; 37(3):367-389-
dc.descriptionThe original publication can be found at
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.publisherKluwer Academic Publ-
dc.subjectSecret sharing schemes, multisecret schemes, geometrical construction-
dc.titleAn optimal multisecret threshold scheme construction-
dc.typeJournal article-
dc.identifier.orcidBarwick, S. [0000-0001-9492-0323]-
dc.identifier.orcidJackson, W. [0000-0002-0894-0916]-
Appears in Collections:Aurora harvest 6
Pure Mathematics publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.