The Structure Of The Two Types Of Verifiable Secret Sharing Scheme

It attracts many scholars’attention in password circles at home and abroad since the concept of the secret sharing is proposed, and we also construct many secret sharing schemes with the function of anti-fraud、 public validation、multi-secret sharing and so on. Based on the secret sharing scheme of detecting cheaters in vector space proposed by Jorge, this paper gives analysis towards it. It is not effective that the method of the black box used to detect the cheaters. We propose a new scheme in detecting of cheaters in vector space. Before the recovery of the secret, the scheme can detect the shares of the participants in two steps. We have proved that the method we used is feasible, so it enhanced the safety and practicality of the scheme in a certain extent.In addition, based on the secret sharing scheme in vector space proposed by Xu Chun-xiang and others, this paper proposes a secret sharing scheme in linear codes. The specific works are as follows:(1) This paper applies the method of regularly updated to the special kind of linear codes, whose first column of the generator matrix has the form of (1,0,...,0)T.(2) To each linear code, we can prove theoretically that they could be transformed into the special kind of linear codes in (1), so we propose the regularly updated secret sharing scheme in linear codes, whose safety was based on the computation difficulty of discrete logarithms.(3) The new scheme is a muti-secret sharing scheme.(4) The new scheme could be validated publicly.