Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Lina Zhang,Li Feng,Xuan Dang,Junhan Yang,Tudor Barbu

doi:10.1155/2021/9274415

Abstract

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.

Highlights

With the development of computer science and technology, online transactions developed rapidly and improved our daily life
We propose two new schemes based on that, where all pixel values participate in the authentication
The successful cheating probability δ 1/251 means that schemeIIis effective in detecting the cheating. Many security fields such as online transactions, digital image storage, and transmission require high security. ere may be tampered with and forged secret sharing to participate in the reconstruction of secret information

Summary

Introduction

With the development of computer science and technology, online transactions developed rapidly and improved our daily life. E work in [8] proposes a new scheme to share secret images by constructing two polynomials, using the first two pixels values of the first polynomial to construct two secret authentication codes and embed them into the second polynomial to detect the existence of deception. Step 3: stored, the and pixel block Pi the original secret ai,0, ai,1, image I. re‖Pt is further restored is scheme clearly illustrates the nature of the threshold k: k or more shadows can reconstruct or recover the original secret image, and less than k shadows reveal no image information. E work in [8] proposes a (k, n)-SIS scheme with deception detection by constructing two secret authentication codes to mosaic the second polynomial through the first two pixels values of the first polynomial to detect the existence of deception. If a false shadow is detected, the restoration of the original secret image should be stopped. e shadow size in this scheme is 1/(k − 1) of that of the original image

The Proposed Scheme

Experiment Results and Analysis

Conclusions