多分发者的秘密共享方案  

Secret sharing scheme based on multi-dealer

作　　者：郭成[1,2] 李明楚[1] 王智慧[1,2] 

机构地区：[1]大连理工大学软件学院,辽宁大连116620 [2]大连理工大学电子与信息工程学院,辽宁大连116024

出　　处：《计算机工程与应用》2009年第6期10-12,共3页Computer Engineering and Applications

基　　金：国家自然科学基金~~

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

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

分 类 号：TN918.4[电子电信—通信与信息系统]