Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/3533
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jackson, W.A. | - |
dc.contributor.author | Martin, K. | - |
dc.contributor.author | O'Keefe, C. | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | Designs, Codes and Cryptography, 1996; 9(3):287-304 | - |
dc.identifier.issn | 0925-1022 | - |
dc.identifier.issn | 1573-7586 | - |
dc.identifier.uri | http://hdl.handle.net/2440/3533 | - |
dc.description.abstract | A 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 sK associated with each k-subset K of these participants. The scheme ensures that sK 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.language.iso | en | - |
dc.publisher | Springer Science and Business Media LLC | - |
dc.source.uri | http://dx.doi.org/10.1007/bf00129770 | - |
dc.title | A construction for multisecret threshold schemes | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1007/bf00129770 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Jackson, W.A. [0000-0002-0894-0916] | - |
Appears in Collections: | Aurora harvest 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.