| 一个可验证的多秘密共享门限方案 |
| |
| 引用本文： | 吴星星,李志慧,李 婧.一个可验证的多秘密共享门限方案[J].计算机工程与应用,2013,49(13):65-67. |
| |
| 作者姓名： | 吴星星 李志慧 李 婧 |
| |
| 作者单位： | 陕西师范大学 数学与信息科学学院，西安 710062 |
| |
| 摘 要： | 利用Shamir(t,n)]门限方案、有限域上的模运算和Lagrange插值多项式提出了一个可验证的多秘密共享门限方案。该方案中，每一个密钥对应的极小访问结构是一个门限访问结构，这样的访问结构实现了在重构阶段可重构部分密钥，而且重构的参与者越多可重构的密钥就越多；与以前的可验证的(t,n)]门限多秘密共享方案相比，该方案更具有实用性。
|
| 关 键 词： | 多秘密共享 Shamir[(t n)]门限方案 双变量单向函数 离散对数 |
Threshold verifiable multi-secret sharing scheme |
| |
| WU Xingxing,LI Zhihui,LI Jing.Threshold verifiable multi-secret sharing scheme[J].Computer Engineering and Applications,2013,49(13):65-67. |
| |
| Authors: | WU Xingxing LI Zhihui LI Jing |
| |
| Affiliation: | College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China |
| |
| Abstract: | A threshold verifiable multi-secret sharing scheme is proposed, which is based on Shamir (t,n)]-threshold scheme, modular arithmetic over finite field and the Lagrange interpolation polynomial. The minimum access structure of each secret is a threshold access structure. This access structure realizes that a part of secrets is recovered in the reconstruction phase, and the more participants there are, the more secrets can be recovered. Compared with the previous verifiable(t,n)]-threshold multi-secret sharing scheme, this scheme is more practical. |
| |
| Keywords: | multi-secret sharing Shamir[(t n)]-threshold secret sharing scheme two-variable one-way function discrete logarithm problem |
|
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
