Some Multisecret-Sharing Schemes over Finite Fields

Selda Çalkavur and Patrick Solé
Additional contact information
Selda Çalkavur: Math Department, Köseköy Vocational School, Kocaeli University, 41135 Kocaeli, Turkey
Patrick Solé: I2M, Aix Marseille University, Centrale Marseille, CNRS, 12M, 163 Avenue de Luminy, 13009 Marseille, France

Mathematics, 2020, vol. 8, issue 5, 1-7

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 reconstruction algorithm is based on Blakley’s method. We determine the access structure and obtain a perfect and ideal scheme.

Keywords: secret sharing; multisecret-sharing scheme; finite field; vector space (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/5/654/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/5/654/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:5:p:654-:d:350320

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().