Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (17): 9-10.DOI: 10.3778/j.issn.1002-8331.2009.17.003
• 博士论坛 • Previous Articles Next Articles
GUO Xian-feng
Received:
Revised:
Online:
Published:
Contact:
郭现峰
通讯作者:
Abstract: Through investigating the secret sharing schemes，points out that YCH scheme is an efficient multi-secret sharing scheme，but it does not has the property of cheat-proof.To overcome this flaw，this paper presents a cheat-proof multi-secret sharing scheme based on RSA.Security analyses indicate that the proposed scheme can resist cheat efficiently.It is capabilities for many applications.
Key words: multi-secret sharing scheme, Rivest-Shamir-Adleman（RSA）, cheat-proof, Shamir
摘要： 针对秘密共享方案进行了分析和研究，指出基于二元单向函数和Shamir（t，n）门限方案的YCH多秘密共享方案无法有效防止欺诈，进而提出了一个基于RSA的防欺诈的多秘密共享方案。该方案在保留了YCH方案的优良特性同时，利用秘密片段和认证片段信息的模余关系来检测欺诈者，具有较强的实用性。
关键词: 多秘密共享, RSA, 防欺诈, Shamir
GUO Xian-feng. cheat-proof multi-secret sharing scheme based on RSA[J]. Computer Engineering and Applications, 2009, 45(17): 9-10.
郭现峰. 基于RSA的防欺诈多秘密共享方案[J]. 计算机工程与应用, 2009, 45(17): 9-10.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.17.003
http://cea.ceaj.org/EN/Y2009/V45/I17/9
