• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (5): 41-45.

• 论文 • Previous Articles     Next Articles

Verifiable threshold multisecret sharing
scheme based on discrete logarithm problem

WANG Xuejun1,2,GAO Caiyun1,CAO Tianjie1,3   

  1. (1.School of Computer Science and Technology,China University of Mining and Technology,Xuzhou 221116;
    2.Department of Computer Science,Suqian College,Suqian 223800;
    3.State Key Laboratory of Information Security,Graduate School of the Chinese Academy of Sciences,Beijing 100049,China)
  • Received:2012-01-04 Revised:2012-05-21 Online:2013-05-25 Published:2013-05-25

Abstract:

The traditional secret sharing scheme cannot verify the fraud of participants or secret distributors. The secret sharing scheme proposed by LinWu et al. can verify these frauds, which requires a lot of computation. The secret shares in this scheme must be calculated which can not meet the randomness of shares. It needs to establish secure channels between the secret distributor and each participant, which increases the burden of the implementation of the scheme. Therefore, an improved secret sharing scheme was proposed in the paper. Participants do not need to verify fraud by the secret distributor, which reduces the calculation of participants. The secret shares are chosed by the participants, which achieves the randomness of secret shares. In addition, the scheme can share multisecret sharing and update the group secrets. It also can dynamically add new participants.

Key words: multisecrets sharing;discrete logarithm problem;threshold scheme