计算机工程2009，Vol.35Issue(15)：141-142,2.
可验证的(t,n)门限多重秘密共享方案
Verifiable (t, n) Threshold Multi-secret Sharing Scheme
摘要
Abstract
In Pang-Liu-Wang scheme, the dealer chooses and delivers secret information to each participant, so a secure channel between them is needed. And in recovery phase, each participant can not check whether another participant provides the true information or not. Aiming at such shortcomings, this paper proposes an improved secret sharing scheme. Each participant selects his secret shadow by himself. Each cooperative participant can check pseudo-shadow others have is true or not. Each participant shares many secrets one time with other participants by holding one shadow even many times.关键词
秘密共享/门限方案/多重秘密共享Key words
secret sharing/ threshold scheme/ multi-secret sharing分类
信息技术与安全科学引用本文复制引用
张艺林,张建中..可验证的(t,n)门限多重秘密共享方案[J].计算机工程,2009,35(15):141-142,2.基金项目
国家自然科学基金资助项目(10571113) （10571113）
陕西省自然科学基金资助项目(2004A14) （2004A14）
陕西省教育厅科学研究计划基金资助项目(07JK375)) （07JK375）
