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

Multi-secret Sharing Scheme of Multi-dealer

作　　者：薛婷[1] 李志慧[1] 柳烨[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程》2011年第2期129-131,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(10571112);陕西省自然科学基础研究计划基金资助项目

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

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

分 类 号：TP309[自动化与计算机技术—计算机系统结构]