An Extended Protected Secret Sharing Scheme
Irfan Alam, Abdul Basit
Abstract
Irfan Alam, Abdul Basit
Abstract
Designing a protocol for the protection of sensitive information from possible thefts, losses, and damages is an important area of research in information security. Secret sharing scheme (SSS) allows a secret to be recovered from a specific set of information. The idea of secret sharing, is to divide the secret into several pieces (or shares) so that secret can be recovered from distributed shares. When shares are released to the network, there is chance to get shares by the adversaries. One of the solution of this problem is protected secret sharing (PSS). In the PSS, shares are used to reconstruct the secret and to establish a secure key between every pair of shareholders. In this paper, we have studied and analyzed the protected secret sharing scheme, and we have proposed an extension of the PSS scheme by using the bivariate polynomial. Where, each shareholder has a pair of shares - one is to reconstruct the secret, and another is for the verification of adversaries.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Designing a protocol for the protection of sensitive information from possible thefts, losses, and damages is an important area of research in information security. Secret sharing scheme (SSS) allows a secret to be recovered from a specific set of information. The idea of secret sharing, is to divide the secret into several pieces (or shares) so that secret can be recovered from distributed shares. When shares are released to the network, there is chance to get shares by the adversaries. One of the solution of this problem is protected secret sharing (PSS). In the PSS, shares are used to reconstruct the secret and to establish a secure key between every pair of shareholders. In this paper, we have studied and analyzed the protected secret sharing scheme, and we have proposed an extension of the PSS scheme by using the bivariate polynomial. Where, each shareholder has a pair of shares - one is to reconstruct the secret, and another is for the verification of adversaries.
Key concepts: Computer science, Scheme (mathematics), Secret sharing, Computer security, Cryptography, Computer network, Mathematics, Mathematical analysis