计算机工程与应用Issue(13)：65-67,3.DOI:10.3778/j.issn.1002-8331.1110-0628
一个可验证的多秘密共享门限方案
Threshold verifiable multi-secret sharing scheme
摘要
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.关键词
多秘密共享/Shamir (t,n)门限方案/双变量单向函数/离散对数Key words
multi-secret sharing/Shamir (t,n)-threshold secret sharing scheme/two-variable one-way function/discrete loga-rithm problem分类
信息技术与安全科学引用本文复制引用
吴星星,李志慧,李婧..一个可验证的多秘密共享门限方案[J].计算机工程与应用,2013,(13):65-67,3.基金项目
国家自然科学基金（No.60873119）。 （）
