摘要： 针对离散对数问题的难解性，利用非交互的零知识证明协议，提出一种访问结构上可公开验证的秘密共享方案，在一次秘密共享过程中可以恢复多个秘密，子秘密份额由参与者自己选择，不需要安全信道，参与者提供的影子可以被任何人检验。分析结果表明，该方案具有安全、易于实现的特点，且适用于一般访问结构上的应用。

关键词: 多秘密共享, 零知识证明, 访问结构, 可公开验证

Abstract: This paper proposes a publicly verifiable secret sharing scheme on access structures based on the discrete logarithm problem under non-interactive proof protocol. Multiple secrets can be recovered in a sharing session, and each participant’s sub-secret is selected by the participant himself, so a secure channel does not need. Anybody is allowed to check the secret shadows provided by participants. Analysis results show that the scheme not only has the properties of security, but also is carried out easily, and it can be used on access structure.

Key words: multi-secret sharing, zero-knowledge proof, access structure, publicly verifiable

中图分类号: 

• TP39