An efficient and secure multi-secret sharing scheme with general access structures
Pang Liaojun, Huixian Li, Wang Yumin
Abstract
Pang Liaojun, Huixian Li, Wang Yumin
Abstract
A multiple secret sharing scheme can share a group of secrets in each sharing session, which is very useful especially in sharing large secrets. However, most of the existing multiple secret sharing schemes are ( t, n ) threshold schemes, so they are fit for only threshold applications and unfit for the applications of general access structures. Due to the fact that a ( t, n ) threshold scheme could only handle a small fraction of the secret sharing idea, a novel multi-secret sharing scheme is proposed, which is designed based on general access structures. The security of this scheme is the same as that of Shamir's threshold secret sharing scheme. Compared with the existing multiple secret sharing schemes, the proposed scheme can provide greater capabilities for many applications because it is able to deal with applications of general access structures.
OpenAlex reports 11 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.
A multiple secret sharing scheme can share a group of secrets in each sharing session, which is very useful especially in sharing large secrets. However, most of the existing multiple secret sharing schemes are ( t, n ) threshold schemes, so they are fit for only threshold applications and unfit for the applications of general access structures. Due to the fact that a ( t, n ) threshold scheme could only handle a small fraction of the secret sharing idea, a novel multi-secret sharing scheme is proposed, which is designed based on general access structures. The security of this scheme is the same as that of Shamir's threshold secret sharing scheme. Compared with the existing multiple secret sharing schemes, the proposed scheme can provide greater capabilities for many applications because it is able to deal with applications of general access structures.
Key concepts: Secret sharing, Secure multi-party computation, Computer science, Scheme (mathematics), Access structure, Homomorphic secret sharing, Verifiable secret sharing, Shamir's Secret Sharing