计算机工程

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

自选子秘密可更新的多秘密共享

谷婷,杜伟章   

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

Renewable Multi-secret Sharing of Self-selecting Sub-secret

GU Ting,DU Weizhang   

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

摘要:

目前已有的无可信中心可公开验证多秘密共享方案不能同时实现子秘密的自选和定期更新。为解决该问题,提出一个无可信中心可公开验证并更新的多秘密共享方案。方案中所有参与者均可自选子秘密,由子秘密生成影子秘密,利用签密算法使得分发的影子秘密可在公开信道上传输,任何人均可验证参与者分发影子秘密的有效性。利用单向散列链实现对影子秘密的更新,对方案的正确性和安全性进行分析,并对欺骗行为进行检测。与已有方案相比,提出的方案不需要可信中心,可由参与者自选子秘密,并且可公开验证、更新及共享多个秘密。

关键词: 可信中心, 自选子秘密, 可公开验证, 可更新, 签密算法, 单向散列链

Abstract:

The existing public verifiable multi-secret sharing schemes without trusted centers can not make sub-secrets self-selected and periodical renewable simultaneously.In order to solve the problem,a public verifiable and renewable multi-secret sharing scheme without trusted centers is proposed.Every participant selects sub-secret and then generates shadow secret.Shadow secrets can be transmitted on public channel based on signcryption algorithm,and the validity of the distribution shadow secrets can be checked by anyone.The one-way hash chains are used to make the shadow sub-secret renewable.The correctness and security of the scheme are analyzed,and the cheatings of the scheme are checked.Compared with existing schemes,the proposed scheme does not need trusted center.Participants can select the sub-secret themselves.And multi-secret can be verified publicly,renewable and shared.

Key words: trusted center, self-selecting sub-secret, public verifiability, renewable, signcryption algorithm, one-way hash chain

中图分类号: