|
计算机应用研究 2006
Publicly Verifiable Secret Sharing Scheme with Perfect Secrecy Feature
|
Abstract:
By means of the intractability of the discrete logarithm problem and Williams scheme, a publicly verifiable threshold secret sharing scheme is proposed with a trusted dealer distributing the secret information in the initialization phase and recoving phases. Every participant only show his own blind sub-secret and other participants are able to verify it. This scheme can prevent adversaries from getting the secret or sub-secrets and the participants from cheating each other efficiently. Furthermore, each share can get the secret in a polynomial time to set orders lastly. It solves some critical questions safely and effi- ciently.