The Research On Verifiable Multi-Secret Sharing Scheme Based On Multilinear Map

At present,secret sharing technology is an important branch in the field of modern cryptography technology.It can solve the problem of data distribution,storage and recovery.The secret sharing technology can provide security support to solve the key management problem and protect information security.It plays an important role in the management,storage,transmission and utilization of secret data.The traditional secret sharing scheme is thresholdbased secret sharing,which has some limitations for practical application.The verifiable secret sharing scheme is an improvement of the traditional secret sharing scheme,which can detect the deception problem between the secret distributor and the secret participant.The multi-secret sharing scheme is an improvement on the efficiency of traditional secret sharing,which can transmit multiple secret information through a secret sharing process.The verifiable multisecret sharing scheme is the complement of the multi-secret sharing scheme and the verifiable secret sharing scheme,which can not only detect the deception problem but also share multiple secrets.In this paper,two aspects of the open verification of secret shares and multiple secret transmission are proposed.The research results are as follows:The paper proposes the multi-secret verifiable secret sharing scheme based on the eigenvalue.In this scheme,the n-order matrix is diagonalized if the matrix has n linearly independent eigenvectors,the different similar matrices that can be diagonalized are taken as the sub-secret shares of different participants.Its security is verified by the design of the black box based on the diagonalization of an invertible matrix.Besides,the paper proposes the verifiable multi-secret sharing scheme based on the general access structure of bilinear map.The general access structure proposed in this scheme is flexible.The construction method of shared secrets has been changed.The secret can be updated at any time,and the participant can also be updated by adding or decreasing.On this basis,a verifiable multi-secret sharing scheme based on multilinear map is proposed.The general access structure of the scheme is also flexible,and its construction method is similar to the scheme based on bilinear map.The difference is that the scheme based on bilinear map can add or delete participants,while the scheme based on multilinear map can flexibly change the access structure.The correctness,security and verifiability of the above three schemes are analyzed in detail in this paper and the performance of the scheme proposed in this paper is compared with the previous schemes.The analysis results show that the scheme proposed in this paper is correct and feasible and the performance has improved.