%0 Journal Article
%T Publicly Verifiable Secret Sharing Scheme with Perfect Secrecy Feature<br>一个完善的可公开验证秘密分享方案*
%A LIU Feng
%A ZHANG Jian-zhong
%A <br>刘锋
%A 张建中
%J 计算机应用研究
%D 2006
%I 
%X 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.
%K Secret Sharing
%K Threshold Scheme
%K Publicly Verifiable
%K Discrete Logarithm<br>秘密分享
%K 门限方案
%K 可公开验证
%K 离散对数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=58E4151804F078B6&yid=37904DC365DD7266&vid=EA389574707BDED3&iid=94C357A881DFC066&sid=6700D0D256586E73&eid=C3BF5C58156BEDF0&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=2&reference_num=6