Graphic multi-secret sharing schemes with one-dimensional cellular automata

摘要

A multi-secret sharing scheme, which is based on one-dimensional reversible cellular automata with memory, allowing any member of a set of participants to share a secret color image with the rest of participants is presented. Moreover, it is also explained that with this scheme, any participant is able to recover all the secret color images if and only if the whole set of participants pools their shadows. Finally, the security of the multi-secret sharing scheme is studied and it is proved that the protocol withstands the most important attacks. In particular, it is secure against any statistical attack.