Adelaide Research & Scholarship
Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/17772
| Citations | ||
| Scopus | Web of Science® | Altmetric |
|---|---|---|
|
?
|
?
|
|
| Type: | Journal article |
| Title: | An optimal multisecret threshold scheme construction |
| Author: | Barwick, S. Jackson, W. |
| Citation: | Designs, Codes and Cryptography, 2005; 37(3):367-389 |
| Publisher: | Kluwer Academic Publ |
| Issue Date: | 2005 |
| ISSN: | 0925-1022 1573-7586 |
| Statement of Responsibility: | 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 |
| DOI: | 10.1007/s10623-004-4031-z |
| Published version: | http://www.springerlink.com/content/b647044l00024832/ |
| 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.