Mutually trusted authority-free secret sharing schemes (Q1382145)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mutually trusted authority-free secret sharing schemes |
scientific article; zbMATH DE number 1133023
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mutually trusted authority-free secret sharing schemes |
scientific article; zbMATH DE number 1133023 |
Statements
Mutually trusted authority-free secret sharing schemes (English)
0 references
12 November 1998
0 references
The traditional approach to secret sharing assumes existence of a trusted authority responsible for initial phase, i.e. generation and distribution of shares to authorized sets of participants. In the paper the problem of establishing secret schemes for a given access structure that do not require such mutually trusted authority (MTA) is studied. Previously, design of MTA-free schemes was restricted to complete access structures only, moreover the basic protocol used there seems not to be able to offer a way to construct MTA-free scheme for a predetermined access structure. In the paper the problem is studied in a more general setting, namely to establish an MTA-free secret sharing scheme for a given access structure which is not necessarily complete. The construction protocol for MTA-free schemes for any access structure is given and its components are then analyzed with respect to three efficiency measures proposed. It is shown that the basic protocol can be improved with respect to each of these measures and for threshold schemes optimal constructions are given. However, improvement with respect to more than one measure is still an open problem, as pointed out in the final section of the paper.
0 references
secret sharing
0 references
threshold schemes
0 references
shares
0 references
trusted authority
0 references