Double Verifiable Lossless Secret Sharing Based on Hyper-chaos Generated Random Grid

10.6633/IJNS.201711.19(6).17

Hang Gao；Mengting Hu；Tiegang Gao；Renhong Cheng

Hash-256 ； Hyper-chaos ； Lossless Restoration ； Random Grid ； Visual Secret Sharing

International Journal of Network Security

19卷6期（2017 / 11 / 01）

1005 - 1015

英文

A novel multi secret sharing scheme is proposed in this paper. In the scheme, n secret images are firstly encrypted by hyper-chaos whose initial values are hash of the image itself. Then the encrypted images are shuffled into n confused images; lastly, the confused images are used to generate n sharing images using the random grid method. The proposed scheme has the advantage such that it can lossless restore the original secret image, and have the double verification ability, that is to say, it can verify whether the anyone of the sharing is modified, and it can also verify the whether the anyone of the original secret image is completely reconstructed. The above ad- vantages make it especially suitable for secret sharing of important images such as medical and military images. Experimental results and some comparison analysis are given to testify the effectiveness of the proposed scheme.