|
|||||
|
|
| 一个可验证的门限多秘密共享方案 | |
| 引用本文： | 庞辽军,李慧贤,李志洁,王育民.一个可验证的门限多秘密共享方案[J].哈尔滨工业大学学报,2008,40(9):1462-1465. |
| 作者姓名： | 庞辽军 李慧贤 李志洁 王育民 |
| 作者单位： | 1. 西安电子科技大学,计算网络与信息安全教育部重点实验室,西安,710071;西安电子科技大学,智能信息处理研究所,西安,710072 2. 西北工业大学,计算机学院,西安,710072 3. 大连民族学院,计算机科学与工程学院,大连,116600 4. 西安电子科技大学,计算网络与信息安全教育部重点实验室,西安,710071 |
| 基金项目： | 国家重点基础研究发展计划(973计划)，国家自然科学基金，陕西省自然科学基金，中国博士后科学基金 |
| 摘 要： | 针对Lin-Wu方案容易受恶意参与者攻击的缺点,基于大整数分解和离散对数问题的难解性,提出了一个新的可验证(t,n)门限多秘密共享方案,有效地解决了秘密分发者和参与者之间各种可能的欺骗.在该方案中,秘密分发者可以动态的增加共享的秘密;各参与者的秘密份额可以重复使用,每个参与者仅需保护一个秘密份额就可以共享多个秘密.与现有方案相比,该方案在预防各种欺骗时所需的指数运算量更小,而且,每共享一个秘密仅需公布3个公共值.分析表明该方案比现有方案更具吸引力,是一个安全有效的秘密共享方案. |
| 关 键 词： | 秘密共享 多秘密共享 骗子识别 可验证秘密共享 |
A verifiable threshold multi-secret sharing scheme |
|
| PANG Liao-jun,LI Hui-xian,LI Zhi-Jie,WANG Yu-Min.A verifiable threshold multi-secret sharing scheme[J].Journal of Harbin Institute of Technology,2008,40(9):1462-1465. | |
| Authors: | PANG Liao-jun LI Hui-xian LI Zhi-Jie WANG Yu-Min |
| Affiliation: | 1(1.The Ministry of Education Key Laboratory of Computer Networks and Information Security,Xidian University,Xi’an 710071, China;2.Institute of Intelligent Information Processing,Xidian University,Xi’an 710071,China;3.School of Computer Science,Northwestern Polytechnical University,Xi’an 710072,China; 4.School of Computer Science and Engineering,Dalian Nationalities University,Dalian 116600,China) |
| Abstract: | Based on the intractability of the factorization problem and the discrete logarithm problem,a verifiable(t,n)-threshold multi-secret sharing scheme is presented to overcome the drampack of Lin-Wu scheme that is easy to be attacked by any malicious participant.The proposed scheme provides an efficient solution to the cheating problems between the dealer and each participant.In this scheme,the dealer can share any new secret among these participants dynamically,and only one reusable secret shadow is required to be kept by each participant for sharing multiple secrets.Compared with the existing schemes,the proposed scheme reduces the number of modular exponentiation operations in preventing the dealer or each participant from cheating,and only 3 public values are required for sharing a secret,which makes the proposed scheme more attractive in computation and communication than the existing ones.Analyses show that this scheme is a secure and efficient secret sharing scheme. |
| Keywords: | secret sharing multi-secret sharing cheater identification verifiable secret sharing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |