Linear multi-secret sharing schemes based on multi-party computation (Q998657)
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: Linear multi-secret sharing schemes based on multi-party computation |
scientific article; zbMATH DE number 5503975
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear multi-secret sharing schemes based on multi-party computation |
scientific article; zbMATH DE number 5503975 |
Statements
Linear multi-secret sharing schemes based on multi-party computation (English)
0 references
9 February 2009
0 references
The authors present a variant of multi secret sharing protocol. The entire study has a step by step explanation, in the classical way: what is done, what is weak, what we improved. In this way, they show as a description of how to improve the security level, according with some assumptions. The mathematical background has a particular way of exposure and can be catalogized like good enough. There are three examples exposed in order to have a better understanding of the model.
0 references
secret sharing protocol
0 references
0 references
0 references
0 references
0.94952524
0 references
0.9362706
0 references
0.9362706
0 references
0.92745066
0 references
0 references
0.9176395
0 references