Some Multisecret-Sharing Schemes over Finite Fields
Keyword(s):
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 reconstruction algorithm is based on Blakley’s method. We determine the access structure and obtain a perfect and ideal scheme.
2018 ◽
Vol 11
(2)
◽
pp. 410-416
Keyword(s):
New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure
2020 ◽
Vol 24
(4)
◽
pp. 357
Keyword(s):
2016 ◽
Vol 27
(05)
◽
pp. 595-605
◽
Keyword(s):
1989 ◽
Vol 72
(9)
◽
pp. 56-64
◽
Keyword(s):
Keyword(s):
2006 ◽
Vol 43
(1)
◽
pp. 33
◽
Keyword(s):