作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (2): 129-131. doi: 10.3969/j.issn.1000-3428.2011.02.044

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

多分发者的多秘密共享方案

薛 婷,李志慧,柳 烨   

  1. (陕西师范大学数学与信息科学学院,西安 710062)
  • 出版日期:2011-01-20 发布日期:2011-01-25
  • 作者简介:薛 婷(1987-),女,硕士研究生,主研方向:有限域,密码学;李志慧,副教授、博士;柳 烨,硕士研究生
  • 基金资助:
    国家自然科学基金资助项目(10571112);陕西省自然科学基础研究计划基金资助项目

Multi-secret Sharing Scheme of Multi-dealer

XUE Ting, LI Zhi-hui, LIU Ye   

  1. (College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China)
  • Online:2011-01-20 Published:2011-01-25

摘要: 传统的秘密共享方案都基于一个秘密分发者,而在一些实际应用中,被共享的秘密信息会被多个秘密分发者共同来维护。基于齐次线性递归序列和离散对数问题的困难性提出一种多分发者的多秘密共享方案。在该方案中,多个秘密分发者可以共同维护秘密信息,并且任意一个分发者都可以动态地更新秘密。在秘密的动态更新过程中,分发者仅需要公布少量的信息而不需要对秘密份额重新分发。方案的安全性依赖于RSA密码体制和离散对数问题的困难性。验证结果表明,该方案是安全的和高效的。

关键词: 秘密共享, 多分发者, RSA密码体制, 离散对数密码体制, 齐次线性递归序列

Abstract: The traditional secret sharing schemes are all based on a single dealer. However, in reality, maybe there are many applications where the shared secrets are commonly maintained by several dealers. This paper proposes a novel secret sharing scheme based on the multi-dealer by means of Homogeneous linear recursion sequence and discrete logarithm problem. In this scheme, several dealers can commonly maintain the secret and the secret can be dynamically renewed by any dealer. In the secret updated phase, the dealer just needs to publish a little public information instead of redistributing the new secret shadows. Its security is based on the security of RSA cryptosystem and the intractability of discrete logarithm problem. Verification result shows that the scheme is secure and efficient.

Key words: secret sharing, multi-dealer, RSA cryptosystem, discrete logarithm cryptosystem, homogeneous linear recursion sequence

中图分类号: