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

cheat-proof multi-secret sharing scheme based on RSA

GUO Xian-feng   

  1. College of Computer Science and Technology,Southwest University for Nationalities,Chengdu 610041,China
  • Received:2009-02-11 Revised:2009-03-16 Online:2009-06-11 Published:2009-06-11
  • Contact: GUO Xian-feng

基于RSA的防欺诈多秘密共享方案

郭现峰   

  1. 西南民族大学 计算机科学与技术学院,成都 610041
  • 通讯作者: 郭现峰

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(tn)门限方案的YCH多秘密共享方案无法有效防止欺诈,进而提出了一个基于RSA的防欺诈的多秘密共享方案。该方案在保留了YCH方案的优良特性同时,利用秘密片段和认证片段信息的模余关系来检测欺诈者,具有较强的实用性。

关键词: 多秘密共享, RSA, 防欺诈, Shamir