International Journal of Network Security
In this paper, the authors presents a key based secured (k and n) thresh-old cryptography where key is used to encrypt the secret and then the secret as well as key is shared among set of n participants. In sharing phase, each secret byte is selected randomly from secret fields depending upon the key. That provides additional protection of the secret data. Also, each share has some bytes missing and these missing bytes can be recovered from a set of exactly k shares. Thus a given byte position can be confirmed for any k shares, but not less than k.