Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/3532
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | A general decomposition construction for incomplete secret sharing schemes |
Author: | van Dijk, M. Jackson, W.A. Martin, K. |
Citation: | Designs, Codes and Cryptography, 1998; 15(3):301-321 |
Publisher: | Springer Science and Business Media LLC |
Issue Date: | 1998 |
ISSN: | 0925-1022 |
Abstract: | A secret sharing scheme for an incomplete access structure (Γ, Δ) is a method of distributing information about a secret among a group of participants in such a way that sets of participants in Γ can reconstruct the secret and sets of participants in Δ can not obtain any new information about the secret. In this paper we present a more precise definition of secret sharing schemes in terms of information theory, and a new decomposition theorem. This theorem generalizes previous decomposition theorems and also works for a more general class of access structures. We demonstrate some applications of the theorem. |
DOI: | 10.1023/a:1008381427667 |
Published version: | http://dx.doi.org/10.1023/a:1008381427667 |
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.