Perfect secret sharing schemes on five participants

Simple item page
dc.contributor.authorJackson, W.A.
dc.contributor.authorMartin, K.
dc.date.issued1996
dc.description.abstractA perfect secret sharing scheme is a system for the protection of a secret among a number of participants in such a way that only certain subsets of these participants can reconstruct the secret, and the remaining subsets can obtain no additional information about the secret. The efficiency of a perfect secret sharing scheme can be assessed in terms of its information rates. In this paper we discuss techniques for obtaining bounds on the information rates of perfect secret sharing schemes an illustrate these techniques using the set of monotone access structures on five participants. We give a full listing of the known information rate bounds for all the monotone access structures on five participants. © 1996 Kluwer Academic Publishers.
dc.identifier.citationDesigns, Codes and Cryptography, 1996; 9(3):267-286
dc.identifier.doi10.1007/bf00129769
dc.identifier.issn0925-1022
dc.identifier.issn1573-7586
dc.identifier.orcidJackson, W.A. [0000-0002-0894-0916]
dc.identifier.urihttp://hdl.handle.net/2440/3534
dc.language.isoen
dc.publisherSpringer Science and Business Media LLC
dc.rights© 1996 Kluwer Academic Publishers
dc.source.urihttps://doi.org/10.1007/bf00129769
dc.titlePerfect secret sharing schemes on five participants
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Pure Mathematics publications