一种可验证的多秘密共享方案

Verifiable multi-secret sharing scheme

利用双变量单向函数和Lagrange插值法提出了一种可验证的多秘密共享方案。方案中,各参与者的子秘密由参与者自己选取,并可重复使用,一次可以恢复多个秘密。秘密分发者不需要向参与者传递任何秘密信息,所以他们之间不需要维护安全信道。方案可检验分发者和参与者的诚实性。

Based on Lagrange interpolation formulas, a verifiable muhi-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.