Linear multi-secret sharing schemes based on multi-party computation (Q998657): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ffa.2006.05.003 / rank
Normal rank
 
Property / author
 
Property / author: Mu-Lan Liu / rank
Normal rank
 
Property / author
 
Property / author: Liang Liang Xiao / rank
Normal rank
 
Property / author
 
Property / author: Mu-Lan Liu / rank
 
Normal rank
Property / author
 
Property / author: Liang Liang Xiao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2006.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079911255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret sharing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multi-secret sharing schemes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.FFA.2006.05.003 / rank
 
Normal rank

Latest revision as of 12:04, 10 December 2024

scientific article
Language Label Description Also known as
English
Linear multi-secret sharing schemes based on multi-party computation
scientific article

    Statements

    Linear multi-secret sharing schemes based on multi-party computation (English)
    0 references
    0 references
    0 references
    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 references
    0 references

    Identifiers