Open AccessA New Approach to Construct Secret Sharing Schemes Based on Field Extensions
Author(s) -
Fatih Molla,
Selda Çalkavur
Publication year - 2018
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v11i2.3250
Subject(s) - secret sharing , homomorphic secret sharing , construct (python library) , access structure , verifiable secret sharing , mathematics , shared secret , secure multi party computation , scheme (mathematics) , field (mathematics) , set (abstract data type) , password , shamir's secret sharing , theoretical computer science , key (lock) , cryptography , computer science , computer security , algorithm , computer network , mathematical analysis , pure mathematics , programming language
Secret sharing has been a subject of study since 1979. It is important that a secret key, passwords, information of the map of a secret place or an important formula must be keptsecret. The main problem is to divide the secret into pieces instead of storing the whole for a secret sharing. A secret sharing scheme is a way of distributing a secret among a nite set of people such that only some distinguished subsets of these subsets can recover the secret. The collection of these special subsets is called the access structure of the scheme.In this paper, we propose a new approach to construct secret sharing schemes based on field extensions.