摘要
现有的无可信中心秘密共享方案中,当有新成员加入时,由于没有传统的可信中心来分发秘密份额,新成员很难获得秘密份额。针对这个问题,基于离散对数求解的困难性,提出一个新的无可信中心秘密共享方案。该方案允许新成员加入,已有成员可以协助新成员获取秘密份额,而不必泄露自己的秘密份额。因此,该方案具有很高的公正性、安全性和鲁棒性。
In the present secret sharing scheme without a trusted party,if there isn＇t a trusted party which can distribute share to every member,the new member can hardly gain his or her share.To solve this problem,a new secret sharing scheme based on the intractability of the discrete logarithm is presented.This scheme could permit a new member to join in,and the original members＇ share will not be leaked out when they help the new member to gain the share.The proposed scheme which is secure,fair and robust,has good practical application.
出处
《重庆科技学院学报（自然科学版）》
CAS
2011年第6期173-175,182,共4页
Journal of Chongqing University of Science and Technology：Natural Sciences Edition
基金
安徽高校省级自然科学研究项目(KJ2010B162)
合肥师范学院院级科研项目(2011kj03)
