Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (6): 10-12.DOI: 10.3778/j.issn.1002-8331.2009.06.003

• 博士论坛 • Previous Articles     Next Articles

Secret sharing scheme based on multi-dealer

GUO Cheng1,2,LI Ming-chu1,WANG Zhi-hui1,2   

  1. 1.School of Software,Dalian University of Technology,Dalian,Liaoning 116620,China
    2.Department of Electronic & Information Engineering,Dalian University of Technology,Dalian,Liaoning 116024,China
  • Received:2008-10-16 Revised:2008-11-24 Online:2009-02-21 Published:2009-02-21
  • Contact: GUO Cheng

多分发者的秘密共享方案

郭 成1,2,李明楚1,王智慧1,2   

  1. 1.大连理工大学 软件学院,辽宁 大连 116620
    2.大连理工大学 电子与信息工程学院,辽宁 大连 116024
  • 通讯作者: 郭 成

Abstract: The traditional secret sharing schemes are all based on a single dealer.However,in reality,maybe there are many applications where the shared secret is commonly maintained by several dealers.In this paper,a novel secret sharing scheme is proposed based on the multi-dealer by means of Shamir’s threshold scheme 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 Shamir’s threshold scheme and the intractability of discrete logarithm problem.

Key words: secret sharing, multi-dealer, discrete logarithm, threshold scheme

摘要: 传统的秘密共享方案都是基于一个秘密分发者。而在某些实际的应用中,被共享的秘密信息也许会被多个秘密分发者共同来维护。基于Shamir门限方案和离散对数问题的困难性提出了一种多分发者的秘密共享方案。在该方案中,多个秘密分发者可以共同维护秘密信息,并且任一分发者可以动态地更新秘密信息。在秘密的动态更新过程中,仅需要公布少量的信息而不需要进行对秘密份额的重新分发。方案的安全性依赖于Shamir门限方案的安全性和离散对数问题的困难性。

关键词: 秘密共享, 多分发者, 离散对数, 门限机制