Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An optimal multisecret threshold scheme construction|
|Citation:||Designs Codes and Cryptography, 2005; 37(3):367-389|
|Publisher:||Kluwer Academic Publ|
|S. G. Barwick and Wen-Ai Jackson|
|Abstract:||A 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.|
|Keywords:||Secret sharing schemes, multisecret schemes, geometrical construction|
|Description:||The original publication can be found at www.springerlink.com|
|Appears in Collections:||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.