scholarly journals A New Secret Sharing Scheme Based on Polynomials over Finite Fields

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1200
Author(s):  
Selda Çalkavur ◽  
Patrick Solé ◽  
Alexis Bonnecaze
Keyword(s):  
Finite Fields ◽  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Polynomial Multiplication ◽  
Sharing Scheme ◽  
Polynomials Over Finite Fields

In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.

scholarly journals Some Multisecret-Sharing Schemes over Finite Fields

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 654 ◽  
Author(s):  
Selda Çalkavur ◽  
Patrick Solé
Keyword(s):  
Finite Fields ◽  
Secret Sharing ◽  
Reconstruction Algorithm ◽  
Digital Signatures ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Private Key ◽  
Sharing Scheme

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.

scholarly journals Secret Sharing Schemes Based on Extension Fields

2018 ◽  
Vol 11 (2) ◽  
pp. 410-416
Author(s):  
Selda Çalkavur
Keyword(s):  
Finite Fields ◽  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Sharing Scheme

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 corollary

Withdrawn: A New Secret Sharing Scheme of Large-scale Electronic Voting

2019 ◽  
Vol 12 ◽  
Author(s):  
Ting Liu ◽  
Zhe Cui ◽  
Hongquan Pu ◽  
Jintao Rao
Keyword(s):  
Secret Sharing ◽  
Large Scale ◽  
Electronic Voting ◽  
Secret Sharing Scheme ◽  
Technical Errors ◽  
Electronic Engineering ◽  
Sharing Scheme ◽  
Recent Advances ◽  
Copyright Permission ◽  
Legal Right

The article for the journal Recent Advances in Electrical and Electronic Engineering has been withdrawn on the request of the authors due to some technical errors in the article. Bentham Science apologizes to the readers of the journal for any inconvenience this may cause. BENTHAM SCIENCE DISCLAIMER: It is a condition of publication that manuscripts submitted to this journal have not been published and will not be simultaneously submitted or published elsewhere. Furthermore, any data, illustration, structure or table that has been published elsewhere must be reported, and copyright permission for reproduction must be obtained. Plagiarism is strictly forbidden, and by submitting the article for publication the authors agree that the publishers have the legal right to take appropriate action against the authors, if plagiarism or fabricated information is discovered. By submitting a manuscript the authors agree that the copyright of their article is transferred to the publishers if and when the article is accepted for publication.

Sign in / Sign up

Export Citation Format

Share Document