Current Proceedings on Technology
Yazarlar: Derya Arda, Ercan Bulus
Konular:-
Anahtar Kelimeler:Secret sharing scheme,Cryptography,Coding theory,MDS codes
Özet: Secret Sharing Scheme is a technique developed for secret information like cryptographic keys and aims to increase the security against attacks by dividing the secret key into pieces and distribute the pieces to different persons in a group so that certain subsets of the group can get together to recover the key. This notion was first proposed by Shamir and Blakley in 1979. Actually they gave threshold secret sharing scheme. Since then, many constructions have been proposed. One of them is based on coding theory. In this paper, we present an application of the (k, n) threshold secret sharing scheme using (n+1, k) MDS (Maximum Distance Separable) codes, which is defined over GF(2n). It is also shown that at least k participants of a set of n participants are needed to reconstruct the secret.