Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/39579
Title: Scalable threshold closure
Authors: Zhang, C.
Lam, K.-Y. 
Jajodia, S.
Keywords: Access structure
Scalability
Secret sharing scheme
The Shamir threshold scheme
Threshold closure
Issue Date: 1999
Source: Zhang, C.,Lam, K.-Y.,Jajodia, S. (1999). Scalable threshold closure. Theoretical Computer Science 226 (1-2) : 185-206. ScholarBank@NUS Repository.
Abstract: Secret sharing is an important concept for implementing robust and secure computer systems. A (t, ℓ)-threshold scheme such as Shamir's (Commun. ACM22(11) (1979) 612-613) is a mechanism that allows a set of ℓ participants to share a secret such that only subsets of t or more participants can reconstruct it. The threshold scheme, though simple and easy to implement, is not flexible enough to support complex secret sharing policies typical in practical systems. An access structure (Benaloh and Leichter, Advances in Cryptology - CRYPTO'88, Lecture Notes in Computer Science, vol. 403, Springer, Berlin, 1990, pp. 27-35; Ito et al., Globecom'87, Tokyo, Japan, 1987, pp. 99-102), on the other hand, is a powerful concept by which complex secret sharing schemes may be represented. However, the implementation is very complicated when the access structure contains a great number of authorized sets. This paper introduces a new construction for the secret sharing schemes called threshold closure, which allows a complex access structure it represents to be realized by possibly the fewest number of (t, ℓ)-threshold schemes. © 1999 Elsevier Science B.V. All rights reserved.
Source Title: Theoretical Computer Science
URI: http://scholarbank.nus.edu.sg/handle/10635/39579
ISSN: 03043975
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

38
checked on Dec 15, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.