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
Issue
Section
Discrete Mathematics
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.
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