A construction for multisecret threshold schemes

Simple item page
dc.contributor.authorJackson, W.A.
dc.contributor.authorMartin, K.
dc.contributor.authorO'Keefe, C.
dc.date.issued1996
dc.description.abstractA multisecret threshold scheme is a system that protects a number of secrets (or keys) among a group of participants, as follows. Given a set of n participants, there is a secret s<inf>K</inf> associated with each k-subset K of these participants. The scheme ensures that s<inf>K</inf> can be reconstructed by any group of t participants in K (1 ≤ t ≤ k). A lower bound has been established on the amount of information that participants must hold in order to ensure that any set of up to w participants (0 ≤ w ≤ n - k + t - 1) cannot obtain any information about a secret with which they are not associated. In this paper, for parameters t = 2 and w = n - k + t - 1, we give a construction for multisecret threshold schemes that satisfy this bound. © 1996 Kluwer Academic Publishers.
dc.identifier.citationDesigns, Codes and Cryptography, 1996; 9(3):287-304
dc.identifier.doi10.1007/bf00129770
dc.identifier.issn0925-1022
dc.identifier.issn1573-7586
dc.identifier.orcidJackson, W.A. [0000-0002-0894-0916]
dc.identifier.urihttp://hdl.handle.net/2440/3533
dc.language.isoen
dc.publisherSpringer Science and Business Media LLC
dc.source.urihttps://doi.org/10.1007/bf00129770
dc.titleA construction for multisecret threshold schemes
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Pure Mathematics publications