摘要
利用Shamir门限体制的思想提出了一种可验证的多组织多秘密共享方案.该方案能保证重要信息和秘密数据的安全存储、传输及合法利用.在该方案中,主要的构造方法用到了Lagrange插值多项式和数论的知识,验证阶段用到了离散对数的一些知识,在计算上较为复杂.通过对这些数学知识的运用,每个参与者在秘密恢复阶段为了防止其他参与者进行欺诈,能验证其他参与者提供的秘密份额是否有效.方案的安全性是基于离散对数的难解性.经分析说明该方案证实是安全可行的,具有一定的应用价值.
A verifiable multi-organization multi-secret sharing scheme is proposed,which is based on the idea of Shamir threshold system.It is extension of Shamir threshold scheme.The scheme can ensure the secure storage of important information and secret data,transmission and the legal utilization.In this scheme,the main construction method used in the Lagrange interpolation polynomial and number theory of knowledge,validation phase uses some knowledge of discrete logarithm,which is more complicated in the calculation.Through the use of these mathematical knowledges,each participant in the secret recovery phase can verify the validity of the secret share of the other participants provided for preventing the other participants from cheating,The program＇s security is based on the intractability of discrete logarithm.After the final analysis,the program is proved to be feasible and safe.
出处
《长沙理工大学学报（自然科学版）》
CAS
2011年第1期70-73,共4页
Journal of Changsha University of Science and Technology:Natural Science
关键词
Shamir门限体制
可验证
多组织多秘密
离散对数
Shamir threshold system
verifiability
multi-organization multi-secret
discrete logarithm
