A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))

In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security.

Public key based bidirectional shadow image authentication without pixel expansion in image secret sharing

Image secret sharing(ISS)is gaining popularity due to the importance of digital images and its wide application to cloud-based distributed storage and multiparty secure computing.Shadow image authentication generally includes shadow image detection and identification,and plays an important role in ISS.However,traditional dealer-participatory methods,which suffer from significant pixel expansion or storing auxiliary information,authenticate the shadow image mainly during the decoding phase,also known as unidirectional authentication.The authentication of the shadow image in the distributing(encoding)phase is also important for the participant.In this study,we introduce a public key based bidirectional shadow image authentication method in ISS without pixel expansion for a(k,n)threshold.When the dealer distributes each shadow image to a corresponding participant,the participant can authenticate the received shadow image with his/her private key.In the decoding phase,the dealer can authenticate each received shadow image with a secret key;in addition,the dealer can losslessly decode the secret image with any k or more shadow images.The proposed method is validated using theoretical analyses,illustrations,and comparisons.

The Review of Secret Image Sharing

Secret image sharing(SIS)is a significant research topic of image information hiding,which divides the image into multiple shares and dis-tributes them to multiple parties for management and preservation.In order to reconstruct the original image,a subset with predetermined number of shares is needed.And just because it is not necessary to use all of the shares to make a reconstruction,SIS creates a high fault tolerance which breaks the limitations of traditional image protection methods,but at the same time,it causes a reduce of safety.Recently,new technologies,such as deep learning and blockchain,have been applied into SIS to improve its efficiency and security.This paper gives an overall review of SIS,discusses four important approaches for SIS,and makes a comparison analysis among them from the perspectives of pixel expansion,tamper resistance,etc.At the end,this paper indicates the possible research directions of SIS in the future.

A Novel(n,n)Secret Image Sharing Scheme Based on Sudoku

Recently, Chang et al. proposed a Sudoku-based secret image sharing scheme. They utilized the Sudoku grid to generate meaningful shadow images, and their scheme satisfied all essential requirements. Based on Chang et al.＇s scheme, we propose a novel （n, n） secret image sharing scheme based on Sudoku. In the proposed scheme, a secret image can be shared among n different cover images by generating n shadow images, and the secret image can be reconstructed without distortion using only these n shadow images. Also, the proposed scheme can solve the overflow and underflow problems. The experimental results show that the visual quality of the shadow images is satisfactory. Furthermore, the proposed scheme allows for a large embedding capacity.

Reversible data hiding based on histogram and prediction error for sharing secret data

With the advancement of communication technology,a large number of data are constantly transmitted through the internet for various purposes,which are prone to be illegally accessed by third parties.Therefore,securing such data is crucial to protect the transmitted information from falling into the wrong hands.Among data protection schemes,Secret Image Sharing is one of the most popular methods.It protects critical messages or data by embedding them in an image and sharing it with some users.Furthermore,it combines the security concepts in that private data are embedded into a cover image and then secured using the secret-sharing method.Despite its advantages,this method may produce noise,making the resulting stego file much different from its cover.Moreover,the size of private data that can be embedded is limited.This research works on these problems by utilizing prediction-error expansion and histogram-based approaches to embed the data.To recover the cover image,the SS method based on the Chinese remainder theorem is used.The experimental results indicate that this proposed method performs better than similar methods in several cover images and scenarios.

A Verifiable Secret Image Sharing Scheme Based on Compressive Sensing

This paper proposes a verifiable secret image sharing scheme based on compressive sensing, secret sharing, and image hashing. In this scheme, Toeplitz matrix generated by two chaotic maps is employed as measurement matrix. With the help of Shamir threshold scheme and image hashing, the receivers can obtain the stored values and the hash value of image. In the verifying stage and restoring stage, there must be at least t legal receivers to get the effective information. By comparing the hash value of the restored image with the hash value of original image, the scheme can effectively prevent the attacker from tampering or forging the shared images. Experimental results show that the proposed scheme has good recovery performance, can effectively reduce space, and is suitable for real-time transmission, storage, and verification.