Tamper-proof secret image-sharing scheme for identifying cheated secret keys and shared images

Abstract

A ðt; nÞ secret image-sharing scheme shares a secret image to n participants, and the t users recover the image. During the recovery procedure of a conventional secret image-sharing scheme, cheaters may use counterfeit secret keys or modified shared images to cheat other users' secret keys and shared images. A cheated secret key or shared image leads to an incorrect secret image. Unfortunately, the cheater cannot be identified. We present an exponent and modulus-based scheme to provide a tamperproof secret image-sharing scheme for identifying cheaters on secret keys or shared images. The proposed scheme allows users to securely select their secret key. This assignment can be performed over networks. Modulus results of each shared image is calculated to recognize cheaters of a shared image. Experimental results indicate that the proposed scheme is excellent at identifying cheated secret keys and shared images.

A Secure Secret Image Sharing Scheme Without Safeguarding a Key

“…The security of image secret sharing is reduced. Most image secret sharing schemes [14][15][16][17] based on Interpolation polynomial choose the continuous and unprocessed pixels instead of random numbers as the coefficients of the polynomial. Since the neighbor pixels have similar values, the generated shadow images may include much information about the secret image.…”

Share a Secret Image With Invertible and Lossy Charateristics

“…Then, many researchers proposed other functional secret image sharing schemes, such as reduced load for sharing multiple secret images 2,3 , cheater identification 4 , progressive sharing 5,6 , weighted sharing 7 , visual cryptography and secret image sharing 8 , authentication strength 9 , and scalable sharing 10 .…”