摘要
采用具有信息论安全的非交互可验证承诺方案,结合Shamir门限秘密共享方法,构造了一个非交互式可验证的生成(k,n)门限秘密共享的多方安全计算方案。协议中的验证过程可以防止参与者的欺骗行为,可以抵抗少于k个参与者的合谋攻击,具有高安全性。秘密共享的产生是非交互式的,具有较高的效率。同时给出了方案的安全性证明并进行了性能分析。
Based on the non-interactive and information-theoretic secure verifiable commitment scheme and combined with Shamir's threshold secret sharing scheme,a multi-party secure computation scheme that generates a(k,n) threshold secret sharing was constructed in this paper.The scheme enjoys high security at the verifying stage.It can avoid any participant to cheat in the protocol and resist less than k participants' coalition.The scheme is high efficient,because the generation of shares of the secret is non-intera...
出处
《武汉理工大学学报》
CAS
CSCD
北大核心
2008年第1期98-101,共4页
Journal of Wuhan University of Technology
基金
国家自然科学基金(60403027)
关键词
密钥产生
多方计算
秘密共享
门限加密
key generation
multi-party computation
secret sharing
threshold encryption