本文已被：浏览 1430次 下载 1822次
Received:June 26, 2015 Revised:September 06, 2015
Received:June 26, 2015 Revised:September 06, 2015
中文摘要: 基于不定方程整数解的存在性及大整数分解的困难性,以Shamir(t,n)门限方案为基础,提出了一种可公开验证的秘密共享方案.方案利用大整数分解的困难性为共享者建立秘密份额,通过不定方程整数解的存在性计算方程的特解组合,共享秘密由共享者的秘密份额和特解组合元素共同计算恢复;方案实现了对秘密份额、参与者之间及参与者对分发者的有效性验证.安全分析表明,该方案是安全的,具有一定的实际应用价值.
Abstract:Due to the existence of indeterminate equation integer solutions and the difficulty of large numbers factorization, a publicly verified secret sharing scheme was proposed based on Shamir(t, n) threshold scheme. With the difficulty of big integer factorization, the scheme established a secret share for the sharers and calculated special solution combination of equation through the existence of indeterminate equation integer solutions. Share secret was recovered common calculation of sharers' secret share and special solution combination elements. In addition, the scheme realized the effective validation of the secret share, between the participants, as well as participants and the distributors. Security analysis shows that the scheme is safe, and has certain practical value.
keywords: indeterminate equation large numbers factorization secret sharing publicly verifiable sharing scheme
文章编号： 中图分类号： 文献标志码：
基金项目:国家自然科学基金(21373132);陕西省教育厅资助项目(14JK1132);陕西理工学院科研计划资助项目(SLGKY14-09).
| Author Name | Affiliation |
| CAO Yang | School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723000, China |
| Author Name | Affiliation |
| CAO Yang | School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong 723000, China |
引用文本：
曹阳.基于大整数分解可公开验证的秘密共享方案.计算机系统应用,2016,25(3):271-273
CAO Yang.Publicly Verifiable Secret Sharing Scheme Based on Large Numbers Factorization.COMPUTER SYSTEMS APPLICATIONS,2016,25(3):271-273
曹阳.基于大整数分解可公开验证的秘密共享方案.计算机系统应用,2016,25(3):271-273
CAO Yang.Publicly Verifiable Secret Sharing Scheme Based on Large Numbers Factorization.COMPUTER SYSTEMS APPLICATIONS,2016,25(3):271-273
