Verifiable multi-secret sharing scheme
Shu-Cui Xie
Abstract
Shu-Cui Xie
Abstract
Based on Lagrange interpolation formulas,a verifiable multi-secret sharing scheme is proposed which makes use of two-variable one-way function.In the scheme,each participant's secret shadow is selected by the participant himself,and the sub-secret of every participant can be reused.And many secrets can be recovered at one time.The dealers do not need to deliver any secret message to participants,so a secure channel between them is unnecessary.The scheme can check whether the dealer and the participant are honest.
A significance statement is not available in the OpenAlex record.
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.
Based on Lagrange interpolation formulas,a verifiable multi-secret sharing scheme is proposed which makes use of two-variable one-way function.In the scheme,each participant's secret shadow is selected by the participant himself,and the sub-secret of every participant can be reused.And many secrets can be recovered at one time.The dealers do not need to deliver any secret message to participants,so a secure channel between them is unnecessary.The scheme can check whether the dealer and the participant are honest.
Key concepts: Verifiable secret sharing, Secret sharing, Homomorphic secret sharing, Secure channel, Secure multi-party computation, Scheme (mathematics), Shamir's Secret Sharing, Computer security