A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:۱) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. ۲) 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.۳) The scheme does not encounter time-consuming computationslike discrete logarithm problem.۴) The validity of the transmitted data can be verified by the combiner and participants.۵) 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 comparisonsamong other schemes and our scheme prove the efficiency of our scheme.

کلیدواژه ها:

Secret sharing ، Adversary fuzzy structure ، One-way hash function ، Finite automaton ، Weakly invertible