摘要
将ElGamal体制和Asmuth-Bloom门限秘密共享方案相结合,提出了一个可验证的(t,n)门限秘密共享方案.该方案提出了有效措施来防止秘密份额在分发的过程中被篡改,并且该方案还提供了检验参与者是否提供了正确的秘密份额的方法.而此方案的安全性是基于有限域中解决离散对数问题的困难性.
In this paper,a verifiable threshold secret sharing scheme is given,which associate ELGamal system with Asmuth-Bloom threshold secret sharing scheme.The scheme put forward some effective measures to prevent the secret share in the distribution in the process of being tampered with and how to check members if given feigned secret share.Its security is based on diffculty discrete logarithm problem in finite field.
出处
《哈尔滨师范大学自然科学学报》
CAS
2011年第3期35-38,共4页
Natural Science Journal of Harbin Normal University
