Dynamic Multi-Secret Sharing Scheme Based on Cellular Automata

In order to solve the problem that the previous cellular automata based multi-secret sharing schemes are unsecure and inflexible, a verifiable dynamic multi-secret sharing scheme is presented in this paper. In the proposed scheme, the shares of participants can be reused so that the computation cost of the dealer is reduced. New participants or new secrets can be added into the system without updating the shares of original participants. Cheating of dealer and participant can be detected and identified during the process of distributing the shares and reconstructing the secret. These features contribute to improve the success probability of constructing secret and security.