A novel secret sharing scheme based on Shamir’s secret sharing scheme over field extensions

In 1979, secret sharing came into picture for the first time by Shamir [11] and Blakley [3]. To keep passwords, important formulas, etc. as secret, this technique was introduced. The key idea behind it is that a dealer distributes a secret among n shares and t from n can come together and recreate the secret. This approach has lots of applications in secure multiparty communication, key distribution, oblivious transfer,visual cryptography, etc. Here we mention a novel approach based on finite field extension to construct a new secret sharing technique using Shamir’s method as a base. In this scheme, a secret is an element of field extension, and few specified subsets of participants, called an access structure, recover the secret using the Lagrange interpolation. The recovery of a secret can be done by some uniquely determined elements of field extension. It is not easy to break a secret. This proves that the proposed scheme has very reliable and strong access structure collection of authorized subsets.