scholarly journals Secret Image Sharing Scheme with Threshold Changeable Capability

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.

scholarly journals Meaningful Secret Image Sharing Scheme with High Visual Quality Based on Natural Steganography

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1452
Author(s):  
Yuyuan Sun ◽  
Yuliang Lu ◽  
Jinrui Chen ◽  
Weiming Zhang ◽  
Xuehu Yan
Keyword(s):  
Visual Quality ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Protection ◽  
Embedding Rate ◽  
Secret Image Sharing Scheme

The (k,n)-threshold Secret Image Sharing scheme (SISS) is a solution to image protection. However, the shadow images generated by traditional SISS are noise-like, easily arousing deep suspicions, so that it is significant to generate meaningful shadow images. One solution is to embed the shadow images into meaningful natural images and visual quality should be considered first. Limited by embedding rate, the existing schemes have made concessions in size and visual quality of shadow images, and few of them take the ability of anti-steganalysis into consideration. In this paper, a meaningful SISS that is based on Natural Steganography (MSISS-NS) is proposed. The secret image is firstly divided into n small-sized shadow images with Chinese Reminder Theorem, which are then embedded into RAW images to simulate the images with higher ISO parameters with NS. In MSISS-NS, the visual quality of shadow images is improved significantly. Additionally, as the payload of cover images with NS is larger than the size of small-sized shadow images, the scheme performs well not only in visual camouflage, but also in other aspects, like lossless recovery, no pixel expansion, and resisting steganalysis.

An Efficient Secret Image Sharing Scheme

2013 ◽  
Vol 284-287 ◽  
pp. 3025-3029
Author(s):  
Kuang Shyr Wu ◽  
Tsung Ming Lo
Keyword(s):  
Security Analysis ◽  
Experimental Results ◽  
Alternative Solution ◽  
Gray Level ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
The Right ◽  
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.

(t, n) Threshold secret image sharing scheme with adversary structure

2016 ◽  
Vol 76 (20) ◽  
pp. 21193-21210 ◽  
Author(s):  
Cheng Guo ◽  
Qiongqiong Yuan ◽  
Kun Lu ◽  
Mingchu Li ◽  
Zhangjie Fu
Keyword(s):  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Adversary Structure ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

scholarly journals A Novel Threshold Changeable Secret Image Sharing Scheme

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 286
Author(s):  
Guohua Wu ◽  
Mingyao Wang ◽  
Qiuhua Wang ◽  
Ye Yao ◽  
Lifeng Yuan ◽  
...  
Keyword(s):  
Theoretical Analysis ◽  
Product Design ◽  
Security Policy ◽  
Secret Image Sharing ◽  
Stego Image ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Engineering Drawings ◽  
Secret Image Sharing Scheme

In secret image sharing, the image is divided into several stego images, which are managed by corresponding participants. The secret image can be recovered only when the number of authorized participants is no less than the threshold. Thus, it is widely used to protect essential images, such as engineering drawings and product design drawings. In the traditional secret image sharing scheme, the threshold is fixed and unique. However, in practice, the security policy and the adversarial structure may change; therefore, the threshold must be adjusted dynamically. In this paper, we propose a novel secret image sharing scheme with a changeable threshold capability. Our scheme eliminates the limit of the changeable threshold and reduces the computation required. Also, our scheme is the first threshold changeable secret image sharing scheme that can recover an undistorted cover image. The theoretical analysis shows that our scheme is safe even if the threshold is changed. The experiments demonstrated that the stego image generated by our algorithm has better quality than other changeable-threshold, secret image sharing algorithms.

Distortion less secret image sharing scheme for Internet of Things system

2017 ◽  
Vol 22 (S1) ◽  
pp. 2293-2307 ◽  
Author(s):  
Li Li ◽  
M. Shamim Hossain ◽  
Ahmed A. Abd El-Latif ◽  
M. F. Alhamid
Keyword(s):  
Internet Of Things ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Progressive secret image sharing scheme using meaningful shadows

2016 ◽  
Vol 9 (17) ◽  
pp. 4075-4088 ◽  
Author(s):  
Zhi-Hui Wang ◽  
Ya-Feng Di ◽  
Jianjun Li ◽  
Chin-Chen Chang ◽  
Hui Liu
Keyword(s):  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

A novel secret image sharing scheme for true-color images with size constraint

2009 ◽  
Vol 179 (19) ◽  
pp. 3247-3254 ◽  
Author(s):  
Du-Shiau Tsai ◽  
Gwoboa Horng ◽  
Tzung-Her Chen ◽  
Yao-Te Huang
Keyword(s):  
Color Images ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
True Color ◽  
Secret Image Sharing Scheme
Sign in / Sign up

Export Citation Format

Share Document