An Efficient Secret Image Sharing Scheme

This paper refers to a novel (r, n)-threshold secret image sharing scheme with low information overhead. The secret image is encoded into n noise-like shadow images in such a way that any r of the n shares can be used to reveal the secret, and no information about the secret can be revealed from any r–1 or fewer shares. The size of the shadow images is relatively small. Compared with the commonly used in the field of secret image sharing “Thien-Lin algorithm (2002),” the proposed scheme provides an alternative solution for light images. For the security analysis in the case of a 256x256 gray level secret image, if a hacker acquires any r – 1 shadow images, the hacker can construct only r – 1 equations, then the possibility of guessing the right solution is only 1/256. Hence, there are (256x256)/r polynomials, the possibility of obtaining the right image is only (1/256) (256x256)/r. The experimental results and theoretically analysis demonstrate that the proposed scheme performs well.

Download Full-text

Secret Image Sharing Scheme with Threshold Changeable Capability

Mathematical Problems in Engineering ◽

10.1155/2016/9576074 ◽

2016 ◽

Vol 2016 ◽

pp. 1-11

Author(s):

Lifeng Yuan ◽

Mingchu Li ◽

Cheng Guo ◽

Weitong Hu ◽

Xinjian Luo

Keyword(s):

Security Policy ◽

Security Analysis ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Adversary Structure ◽

Sharing Scheme ◽

One Way Function ◽

Secret Image Sharing Scheme

In secret image sharing schemes, the threshold may have to be adjusted in case of changes in the security policy and the adversary structure before recovering the secret image. For example, if participants leave the group, their stego images are useless to them and may not be kept safely. As a result, these images can be easily stolen and utilized by intruders, which reduces the security of the scheme. To solve this problem, we propose a novel threshold changeable secret image sharing scheme withNpotential changeable thresholdst1,t2,…,tN. By preparing advance shares for thresholdst1,t2,…,tNand using the two-variable one-way function to generate the identification value, we can change the threshold when necessary. The experiments show that the quality of the stego images in our scheme is satisfactory and the secret image can be recovered without distortion. Moreover, the security analysis shows that we can change the threshold safely.

Download Full-text

Secret Image Sharing Scheme for Gray-Level Images Using Toeplitz Matrix Based Stream Cipher

Communications in Computer and Information Science - Security in Computing and Communications ◽

10.1007/978-981-15-4825-3_21 ◽

2020 ◽

pp. 257-271

Author(s):

Shailendra Kumar Tripathi ◽

Bhupendra Gupta ◽

K. K. Soundra Pandian ◽

Yumnam Jayanta Singh

Keyword(s):

Toeplitz Matrix ◽

Stream Cipher ◽

Gray Level ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Secret Image Sharing Scheme ◽

Gray Level Images

Download Full-text

An Improved Essential Secret Image Sharing Scheme with Smaller Shadow Size

International Journal of Digital Crime and Forensics ◽

10.4018/ijdcf.2018070107 ◽

2018 ◽

Vol 10 (3) ◽

pp. 78-94 ◽

Cited By ~ 3

Author(s):

Peng Li ◽

Zuquan Liu

Keyword(s):

Experimental Results ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Theoretical Analyses ◽

Secret Image Sharing Scheme

This article describes how in conventional (k, n) secret image sharing (SIS), any k or more shadows can be collaborated together to reveal the secret image. Usually, all shadows have the same importance. Recently, an essential (t, s, k, n) secret image sharing (ESIS) with different importance of shadows were proposed where the n shadows are divided into s essential shadows and n − s non-essential shadows. In reconstruction, it needs at least k shadows which should include at least t essential shadows. In this article, the authors propose an improved (t, s, k, n)-ESIS scheme, where t<k. In their scheme, essential shadows and non-essential shadows have the equal sizes. No concatenation operation is needed in generating shadows. Besides, all shadow sizes are reduced to 1/k times of the secret image. Theoretical analyses and experimental results show that the proposed scheme is feasible with optimal sharing ratios among related works.

Download Full-text

XOR-Based Progressively Secret Image Sharing

Mathematics ◽

10.3390/math9060612 ◽

2021 ◽

Vol 9 (6) ◽

pp. 612

Author(s):

Cheng-Shian Lin ◽

Chien-Chang Chen ◽

Yu-Cheng Chen

Keyword(s):

Experimental Results ◽

Secret Image Sharing ◽

Recovery Method ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

High Security ◽

Secret Image Sharing Scheme

Secret image sharing technology is a strategy for jointly protecting secret images. The (n, n) secret image sharing problem can be solved by conventional Boolean calculation easily. However, how to recover secret images with progressive steps is not addressed. In this study, we proposed an XOR-based (m, t, Ti) multi-secret image sharing scheme that shares m secret images among m participants and recovers m shared images progressively with t thresholds. The proposed secret images partition strategy (SIPS) partitions m secret images to generate intermediate images for different thresholds in the sharing procedure. Based on progressive recovery property, the proposed recovery method recovers parts of the secret images by gathering consecutive shared images. Moreover, gathering all shared images can perfectly recover all secret images. The experimental results show that the proposed XOR-based multi-secret image sharing method has high security and efficiency.

Download Full-text