计算机工程 ›› 2011, Vol. 37 ›› Issue (21): 89-90.doi: 10.3969/j.issn.1000-3428.2011.21.030

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

线性码上的可验证多秘密共享方案

郭玉娟,李志慧,赖 红   

  1. (陕西师范大学数学与信息科学学院,西安 710062)
  • 收稿日期:2011-04-19 出版日期:2011-11-05 发布日期:2011-11-05
  • 作者简介:郭玉娟(1985-),女,硕士研究生,主研方向:密码学,有限域;李志慧,副教授、博士;赖 红,硕士研究生
  • 基金项目:
    国家自然科学基金资助项目(10571112);中央高校基本科研业务费专项基金资助项目(10871123)

Verifiable Multi-secret Sharing Scheme on Linear Codes

GUO Yu-juan, LI Zhi-hui, LAI Hong   

  1. (College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China)
  • Received:2011-04-19 Online:2011-11-05 Published:2011-11-05

摘要: 基于Massy的秘密共享体制和RSA密码体制,提出一个可验证的多秘密共享方案。在秘密共享阶段,参与者的份额由各个参与者自己选取,且其子秘密的传送可以通过公开的信道发送给秘密分发者。在秘密恢复阶段,可以验证参与者是否进行欺骗。该方案可以动态地更新秘密,无需更改参与者的秘密份额,只需更改公告牌上的部分相应信息。与以往的 门限秘密共享方案相比,该方案具有更丰富的授权子集。

关键词: 线性码, RSA密码体制, 多秘密共享体制, 对偶码, 极小码字

Abstract: This paper proposes a verifiable multi-secret sharing scheme based on the Massy secret sharing scheme and RSA encryption algorithm. In the sharing phase, the shares of each participant are chosen by himself or herself and sub-secret is transmitted to the secret dealer by using public channel. In the recovering phase, designated combiner is allowed to check whether each participant provides the true value. Multi-secrets are dynamically renewed without re-distributing the participant’s shares, the dealer only renew the values related to the renewed secrets in a public board. Compared with the former dynamic secret sharing schemes, this scheme has more interesting access structure.

Key words: linear code, RSA encryption system, multi-secret sharing system, dual code, minimal codeword

中图分类号: