2019
DOI: 10.1155/2019/5134534
|View full text |Cite
|
Sign up to set email alerts
|

Linear (t,n) Secret Sharing Scheme with Reduced Number of Polynomials

Abstract: Threshold secret sharing is concerned with the splitting of a secret into shares and distributing them to some persons without revealing its information. Any ≤ persons possessing the shares have the ability to reconstruct the secret, but any persons less than cannot do the reconstruction. Linear secret sharing scheme is an important branch of secret sharing. The purpose of this paper is to propose a new polynomial based linear ( , ) secret sharing scheme, which is based on Shamir's secret sharing scheme and El… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…Shamir's key sharing scheme based on gate trap is described in detail in [12]. Suppose that there are participants who do not trust each other but abide by a secret sharing protocol.…”
Section: Password Sharingmentioning
confidence: 99%
“…Shamir's key sharing scheme based on gate trap is described in detail in [12]. Suppose that there are participants who do not trust each other but abide by a secret sharing protocol.…”
Section: Password Sharingmentioning
confidence: 99%