Title: New Multistage Secret Sharing Scheme Based on the Factorization Problem
Abstract: A (t, n) secret sharing scheme [1, 2] allows a secret to be shared among n users in such a way that only t or more users can reconstruct the secret, but any t − 1 or less users have absolutely no information about the secret. One common drawback of almost all known secret sharing schemes is that they are one-time schemes. That is, once any t or more users reconstruct the secret by pooling their shares, both the secret and all shares become known to everyone within the group and everyone else. Thus, each share kept by each user can be used to reconstruct only one secret. However, if many different secrets have to be shared among the group of users, a straightforward method is to apply the secret sharing scheme repeatedly. In this case, each user has to keep many secret shares, which is very inefficient. In 1994, He and Dawson proposed a multistage (t, n) secret sharing (MSS) scheme [3] based on a one-way function to solve this problem. For k secrets to be shared among n users, only one secret share has to be kept by each user. The share is the same size as any single secret. These k secrets can be reconstructed one by one in a predetermined order, and revelation of the secrets at earlier stages will not compromise the security of
Publication Year: 2001
Publication Date: 2001-05-01
Language: en
Type: article
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot