Abstract
Secret image sharing schemes have been extensively studied by far. However, there are just a few schemes that can restore both the secret image and the cover image losslessly. These schemes have one or more defects in the following aspects: (1) high computation cost; (2) overflow issue existing when modulus operation is used to restore the cover image and the secret image; (3) part of the cover image being severely modified and the stego images having worse visual quality. In this paper, we combine the methods of least significant bits construction (LSBC) and dynamic embedding with one-dimensional cellular automata to propose a new lossless scheme which solves the above issues and can resist differential attack and support parallel computing. Experimental results also show that this scheme has the merit of big embedding capacity.
Highlights
Secret sharing scheme is devoted to protecting secret information from being lost, destroyed by attackers, stolen by illegal users, and so on
We will evaluate this scheme from different aspects such as the visual quality of stego images, embedding capacity, embedding ways, and other features
Comparisons will be made with the previous schemes that can restore both the cover image and the secret image losslessly
Summary
Secret sharing scheme is devoted to protecting secret information from being lost, destroyed by attackers, stolen by illegal users, and so on. It was independently proposed by Shamir [1] and Blakley [2] in 1979. The former one is based on the polynomial interpolation, and the latter one is based on the intersections of some high dimensional planes in a high dimensional space. Suppose that a secret image sharing scheme has (k, n)-threshold, where k ≤ n, in which a secret image is divided into n shadows distributed to n participants. The secret image can only be restored by k or more shadows; but no one can reveal any information about the secret image with any k − 1 or fewer shadows
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
