Open AccessA New Approach to Construct (K, N) Threshold Secret Sharing Schemes Based on Finite Field Extension
Author(s) -
Vanashree Gupta,
Smita Bedekar
Publication year - 2021
Publication title -
journal of mathematical sciences and computational mathematics
Language(s) - English
Resource type - Journals
eISSN - 2688-8300
pISSN - 2644-3368
DOI - 10.15864/jmscm.3106
Subject(s) - secret sharing , computer science , construct (python library) , shared secret , homomorphic secret sharing , computer security , secure multi party computation , cryptography , extension (predicate logic) , password , verifiable secret sharing , encryption , key (lock) , pre shared key , theoretical computer science , key distribution , finite field , field (mathematics) , set (abstract data type) , mathematics , public key cryptography , computer network , discrete mathematics , pure mathematics , programming language
With increase in use of internet there is need to keep passwords, secret keys, important information secret. One way to do this is encryption. But it also need key which should be kept secure. Sometimes key is secure. But what will happens if the key is lost, forgotten etc. This problem can be solved using secret sharing. Instead of sharing whole secret, it is divided into pieces and distributed to finite set of pieces and some subset of pieces called access structure of scheme, which can recover secret. Here we propose a new way to construct threshold secret sharing schemes based on finite field extension using Blakley's secret sharing as a base. It is useful in many cryptographic applications and security. Because of finite fields the size of numbers stays within a specified range, doesn't matter how many operations we apply on number.