计算机工程

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

向量空间上无可信中心的动态多秘密共享方案

王俞力,杜伟章   

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

Dynamic Multi-secret Sharing Scheme in Vector Space Without Trusted Center

WANG Yuli,DU Weizhang   

  1. (College of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China)
  • Received:2016-06-14 Online:2017-07-15 Published:2017-07-15

摘要: 现有向量空间上的秘密共享方案不能实现秘密份额更新和成员数量动态的增加与删除,且很难保证可信中心的存在。为此,提出一种无可信中心的动态多秘密共享方案。秘密份额由所有参与者共同协商产生,不需要可信中心参与,利用双线性对的性质,任何人都能验证分发的秘密份额和更新的秘密份额的正确性。将共享的秘密用一个构造的公开函数进行表示,在重构过程中,参与者通过公开函数可以对多个秘密进行重构。成员的加入与删除由其他成员共同决定,采用老成员协助新成员生成秘密份额的方式,实现成员的动态管理。对该方案进行正确性与安全性证明,与其他向量空间秘密共享方案相比,具有更高的安全性、动态性和使用效率。

关键词: 多秘密共享, 向量空间, 公开验证, 双线性对, 份额更新, 可信中心

Abstract: The existing secret sharing scheme in the vector space cannot achieve the secret share update or the dynamic addition and deletion of members,and it is hard to ensure the existence of trusted center,so a multi-secret sharing scheme without trusted center is proposed.The secret share is negotiated by all participants without trusted center,and anyone can verify the correctness of distributed secret shares and updated ones with the properties of bilinear pairings.A new public function is constructed to express the shared secret,and participants can reconstruct multiple secrets by the public function.Addition and deletion of members are determined by other members jointly,and the way that old members assist new members for generating their secret shares is adopted,which achieves dynamic management of members.The correctness and security of the scheme are proved.Compared with other vector space secret sharing schemes,this scheme has higher security,efficiency and dynamic property.

Key words: multi-secret sharing, vector space, public verification, bilinear parings, share update, trusted center

中图分类号: