Verifiable Secret Sharing Scheme Based on Certain Projective Transformation  

作　　者：Bin Li Bin Li(School of Mathematics, Chengdu Normal University, Chengdu, China)

机构地区：[1]School of Mathematics, Chengdu Normal University, Chengdu, China

出　　处：《American Journal of Computational Mathematics》2021年第2期175-188,共14页美国计算数学期刊（英文）

摘　　要：The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero <em>k</em>-submatrix and theresidual vector of system of hyperplane intersecting line equations is proposed. Based on certain projective transformations in projective space, a verifiable (<em>t</em>, <em>n</em>)-threshold secret sharing scheme is designed by using the structure of solutions of linear equations and the difficulty of solving discrete logarithm problems. The results show that this scheme can verify the correctness of the subkey provided by each participant before the reconstruction of the master key, and can effectively identify the fraudster. The fraudster can only cheat by guessing and the probability of success is only 1/<em>p</em>. The design of the scheme is exquisite and the calculation complexity is small. Each participant only needs to hold a subkey, which is convenient for management and use. The analysis shows that the scheme in this paper meets the security requirements and rules of secret sharing, and it is a computationally secure and effective scheme with good practical value.The main purpose of verifiable secret sharing scheme is to solve the honesty problem of participants. In this paper, the concept of nonzero <em>k</em>-submatrix and theresidual vector of system of hyperplane intersecting line equations is proposed. Based on certain projective transformations in projective space, a verifiable (<em>t</em>, <em>n</em>)-threshold secret sharing scheme is designed by using the structure of solutions of linear equations and the difficulty of solving discrete logarithm problems. The results show that this scheme can verify the correctness of the subkey provided by each participant before the reconstruction of the master key, and can effectively identify the fraudster. The fraudster can only cheat by guessing and the probability of success is only 1/<em>p</em>. The design of the scheme is exquisite and the calculation complexity is small. Each participant only needs to hold a subkey, which is convenient for management and use. The analysis shows that the scheme in this paper meets the security requirements and rules of secret sharing, and it is a computationally secure and effective scheme with good practical value.

关 键 词：Threshold Secret Sharing Projective Transformation Nonzero k–Submatrix Residual Vector of Equations 

分 类 号：O17[理学—数学]