摘要
基于LUC密码体制,提出一种防欺诈的(t,n)门限秘密共享方案。在秘密恢复过程中,任何参与者能够对其他参与者所出示的子秘密进行验证,不仅能有效地阻止敌手窃取秘密,也能有效地防止内部成员之间的相互欺骗;各参与者的子秘密长度与秘密长度相同,方案的信息率为1,是一个理想的方案。该方案的安全性是基于LUC密码体制和Shamir的(t,n)门限秘密共享方案的安全性。
Secret sharing plays an important role in information security and data privacy, Based on LUC cryptosystem, a （t, n） threshold secret sharing scheme is proposed in this paper, which has the capability to identify cheater. In the secret recovery phase, each participant is allowed to check whether another participant provides the true share or not, which can prevent adversaries from getting the secret and the participants cheating each other efficiently. Each participant＇s share is as short as the shared secret. Therefore, this scheme is an ideal one with the information rate 1. The security of this scheme is based on that of the LUC cryptosystem and Shamir＇s （t, n） threshold secret sharing scheme.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2007年第1期108-111,共4页
Journal of University of Electronic Science and Technology of China
基金
国家973计划资助项目(G1999035804)
军事通信技术预研项目
关键词
密码学
信息安全
秘密共享
门限方案
cryptography
information security, secret sharing, threshold scheme
