Verifiable Secret Sharing Scheme

Secret sharing is an important branch of modern cryptography, and it plays a crucial role in safely presserving and protects important information and secret data. The secret sharing is an important part of the cryptography protocol.Since 1979, Shamir and Blakley put forward the concept of secret sharing, the design of practical and efficient secret sharing scheme has become a hot topic. However, as these schemes are discussed,there are many drawbacks in these secret sharing schemes as follows:1) Each participant's shadow are chosen by the secret dealer,then send to the participants by a security channel.However,and the cost of the system is increased.2) The dealer controls each participant's shadow.It means he/she has to protect much of messages; 3) Secret shadow can be used only once and only one secret can be shared during one secret sharing process;4)A dishonest dealer may distribute a fake shadow to a certain participant,and then that participant would subsequently never obtain the true secret.Aims to solve these problems,the paper is researching the secret sharing scheme and its applications, and proposes verifiable(t,n)threshold multi-secret sharing schemeThe main results are as follows:1 We analyze the scheme proposed by Pang-Liao-Wang.We revise the scheme and propose a new verifiable secret sharing scheme.In our scheme,each participant chooses her/his own shadow by her/himself, so the system doesn't need a security channel and the cost of the system can be lowered.In addition,the new scheme is a reusing scheme.2 We propose a new general verifiable secret sharing scheme based on the LUC cryptosystem.The scheme can identify the cheaters and the secret shadows can be reused.