Some Multisecret-Sharing Schemes over Finite Fields
MATHEMATICS, cilt.8, sa.5, 2020 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 8 Sayı: 5
- Basım Tarihi: 2020
- Doi Numarası: 10.3390/math8050654
- Dergi Adı: MATHEMATICS
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, Metadex, zbMATH, Directory of Open Access Journals, Civil Engineering Abstracts
- Kocaeli Üniversitesi Adresli: Evet
Özet
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.