2020
DOI: 10.3390/math8050654
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: A secret sharing scheme is a method of assigning shares for a secret to some participants such that only some distinguished subsets of these subsets can recover the secret while other subsets cannot. Such schemes can be used for sharing a private key, for digital signatures or sharing the key that can be used to decrypt the content of a file. There are many methods for secret sharing. One of them was developed by Blakley. In this work, we construct a multisecret-sharing scheme over finite fields. The reconstru… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…There is a lot of work on the ramp secret sharing scheme. Some of them are given in [8,9]. Alahmadi et al [8] explain a multisecret-sharing scheme based on LCD codes.…”
Section: Secret Sharing Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…There is a lot of work on the ramp secret sharing scheme. Some of them are given in [8,9]. Alahmadi et al [8] explain a multisecret-sharing scheme based on LCD codes.…”
Section: Secret Sharing Schemesmentioning
confidence: 99%
“…They use Blakley's method to construct their scheme. Çalkavur and Solé [9] introduce some multisecret-sharing schemes over finite fields. In their work, they claim that the Blakley scheme does not work well if they replace R with a finite field.…”
Section: Secret Sharing Schemesmentioning
confidence: 99%