Abstract: In existing scheme, the dealer chooses and delivers secret information to every participant, so a secure channel between them is necessary, and in the recovery phase, the scheme can not check whether every participant provides the true information. Aiming at such shortcomings, the paper proposes a verifiable multi-secret sharing scheme based on ECC. Each participant’s secret shadow is selected and kept by the participant himself. The shadows do not need to be changed when the shared secret is renewed, and many secrets can be recovered one time. The scheme can check whether each participant provides the true information, so a secure channel between them is unnecessary.

Key words: elliptic curve, self-pairing, verifiable

摘要： 在现有方案中，各参与者的子秘密由分发者选取，需要通过安全信道发送给各参与者，在秘密恢复时不具有可验证性。针对该问题，提出一种基于ECC的可验证多秘密共享方案。参与者的子秘密由各参与者自己选取，并且可以多次使用。分发者和参与者间不需要安全信道。在秘密恢复时，可以验证各参与者是否进行欺诈，并且一次可以共享多个秘密。

关键词: 椭圆曲线, 自配对, 可验证

CLC Number: 

• TP309