A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper, we introduce a new verifiable multi-use multi-secret sharing scheme based on automata and one-way hash function. The scheme has the adversary fuzzy structure and satisfy the following properties: 1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible finite automata and its security depends on the properties of the one-way hash functions. 3) The scheme does not encounter time-consuming computations like discrete logarithm problem. 4) The validity of the transmitted data can be verified by the combiner and participants. 5) Every participant has only one reusable real-shadow, whereas the most of other existing schemes have more than one shadow. In addition, the proposed scheme which is based on automata has all the properties of a perfect scheme. Finally, the comparisons among other schemes and our scheme prove the efficiency of our scheme.