Image secret sharing is an important branch in secret sharing; and it is a hot topic in the information security of images. For the correlation between adjacent pixels of an image is highly close, the shadow images will reveal the shapes of the original secret image after performing sharing process directly. Currently, the common method is using a permutation function, which is based on a cryptographic key, to permute the pixels of the secret image before sharing process. Then to safeguard the key brings a new problem. It is attractive to find a way to disrupt the correlation between neighboring pixels of an image. In this paper, pixel field is established to break up the correlation between adjacent pixels and it can reconstruct the secret image precisely based on pixel field in this paper. A perfect and ideal (k, n) threshold scheme based on Cauchy RS codes is proposed in this paper.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.