摘要
基于RSA密码体制、单向Hash函数和XOR运算,文章提出一个可验证的动态多秘密共享方案。该方案具有高效性和灵活性,每位参与者仅需保存1个主秘密份额就可根据不同大小的门限值重构不同的主秘密;可以动态添加或更新秘密,也可以动态添加或删除参与者,使方案易于控制。该方案适用于不具备安全信道的环境,具有可验证的性质,可以防止参与者与分发者的欺骗行为。
Base on the RSA cryptosystem, one-way Hash functions and exclusive OR(XOR) operation, this paper proposes a dynamic multi-secret sharing scheme with verification. The scheme is more efficient and flexible, each participant keeps only one master secret share which can reconstruct different group secrets according to the size of threshold values. The scheme can add new secrets or update the secrets, and the scheme also can remove or add participants freely so that the scheme is manageable. The scheme is valuable in the environments where the security channels are unavailable, and it has verifiable property, which can avoid the fraud of the dealer and the participants.
作者
王娅如
李富林
朱士信
WANG Yaru;LI Fulin;ZHU Shixin(School of Mathematics,Hefei University of Technology,Hefei 230601,China)
出处
《合肥工业大学学报（自然科学版）》
CAS
北大核心
2019年第12期1725-1728,共4页
Journal of Hefei University of Technology：Natural Science
基金
国家自然科学基金资助项目(61772168
60973125
61572168)
安徽省自然科学基金资助项目(1508085MA13)
