中文摘要：

Pedersen 介绍的著名不相关、信息理论上的安全可证实的秘密分享计划在一个大素数上。在这篇论文，我们构造新奇不相关、信息理论上的可证实的秘密分享 overRSA (Rivest， Shamir， Adleman ) 模量并且给严密安全证明。怎么在一个组之中散布一个秘密以便任何东西 k 使聚会不关于秘密得到信息，被显示出。介绍计划通常被用于安全分布式的增加和阀值的构造 orforward 安全的签名协议。

英文摘要：

The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.