| 可验证的Asmuth-Bloom门限秘密共享方案 |
| |
| 引用本文： | 程宇,刘焕平.可验证的Asmuth-Bloom门限秘密共享方案[J].哈尔滨师范大学自然科学学报,2011,27(3):35-38. |
| |
| 作者姓名： | 程宇 刘焕平 |
| |
| 作者单位： | 哈尔滨师范大学 |
| |
| 摘 要： | 将ElGamal体制和Asmuth - Bloom门限秘密共享方案相结合,提出了一个可验证的(t,n)门限秘密共享方案.该方案提出了有效措施来防止秘密份额在分发的过程中被篡改,并且该方案还提供了检验参与者是否提供了正确的秘密份额的方法.而此方案的安全性是基于有限域中解决离散对数问题的困难性.
|
| 关 键 词： | 中国剩余定理 Asmuth-Bloom门限秘密共享方案 ElGamal密码体制 检验欺骗者 |
The Asmuth-Bloom Verifiable Threshold Sharing Scheme |
| |
| Cheng Yu
,
Liu Huanping.The Asmuth-Bloom Verifiable Threshold Sharing Scheme[J].Natural Science Journal of Harbin Normal University,2011,27(3):35-38. |
| |
| Authors: | Cheng Yu Liu Huanping |
| |
| Institution: | (Harbin Normal University) |
| |
| Abstract: | 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. |
| |
| Keywords: | Chinese remainder theorem Asmuth-Bloom threshold secret sharing scheme ElGamal cryptosystem Test cheats |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
