Secret Sharing Schemes Based on Extension Fields
DOI:
https://doi.org/10.29020/nybg.ejpam.v11i2.3226Keywords:
extension fields, secret sharing, secret sharing schemesAbstract
A (t, n)−secret sharing scheme is a method of distribution of information among n participants such that t > 1 can reconstruct the secret but t − 1 cannot. There is numerous research about secret sharing schemes. However there is little research on secret sharing schemes based on extension fields. In this paper, we study secret sharing schemes based on extension fields over finite fields. We use two methods to recover the secret. We define the access structure and the accessibility degree for these secret sharing schemes. We also describe our theorems, definitions and a corollaryDownloads
Published
2018-04-27
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
Secret Sharing Schemes Based on Extension Fields. (2018). European Journal of Pure and Applied Mathematics, 11(2), 410-416. https://doi.org/10.29020/nybg.ejpam.v11i2.3226