计算机工程

• 安全技术 • 上一篇    下一篇

无可信中心的可动态更新多秘密共享方案

谷婷,杜伟章   

  1. (长沙理工大学计算机与通信工程学院,长沙 410114)
  • 收稿日期:2015-03-09 出版日期:2016-03-15 发布日期:2016-03-15
  • 作者简介:谷婷(1990-),女,硕士研究生,主研方向为信息安全、密码学;杜伟章,教授、博士。

Dynamically Updatable Multi-secret Sharing Scheme Without Trusted Center

GU Ting,DU Weizhang   

  1. (College of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China)
  • Received:2015-03-09 Online:2016-03-15 Published:2016-03-15

摘要:

在现有可动态更新的多秘密共享方案中都需要可信中心的参与,且未对同时增加或删除多名成员与多个秘密进行研究。为此,提出一种无可信中心的多秘密共享方案。参与者联合生成多个共享的随机秘密,利用单向散列链构造多项式更新秘密份额,防止攻击者窃取秘密信息。基于零知识证明协议,使任何人可验证参与者分发信息的有效性。采用老成员协助新成员获得秘密份额及改变更新多项式次数的方式,解决多名成员与多个秘密的同时增加或删除问题,并实现成员和秘密的动态管理。分析结果表明,与现有秘密共享方案相比,该方案具有较高的安全性。

关键词: 可信中心, 可公开验证, 可动态更新, 零知识证明, 秘密共享

Abstract:

General dynamically updatable multi-secret sharing schemes require the participation of a trusted center,and the problems of adding or deleting several members or secrets simultaneously are not solved.A new multi-secret sharing scheme without trusted center is proposed in this paper.Shared multiple random secrets do not need to be pre-determined.They are jointly generated by all participants.At each updating stage,participants construct the update polynomials by one-way hash chains to update shares periodically.Everyone can verify the validity of the distributed information based on zero-knowledge proof.New members can get shadow secrets with the help of existing members and the times of updating polynomials can be altered,so the problems of simultaneously adding or deleting several member and serects are solved.The analysis result indicates that the scheme has higer security compared with existing schemes.

Key words: trusted center, publicly verifiable, dynamically updatable, zero-knowledge proof, secret sharing

中图分类号: