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

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.

Download Full-text

Reversible secret image sharing scheme with enhanced stego image visual quality

2010 International Conference on Information Society ◽

10.1109/i-society16502.2010.6018815 ◽

2010 ◽

Author(s):

Guzin Ulutas ◽

Mustafa Ulutas ◽

Vasif V. Nabiyev

Keyword(s):

Visual Quality ◽

Secret Image Sharing ◽

Stego Image ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Secret Image Sharing Scheme

Download Full-text

A Novel Progressive Secret Image Sharing Scheme Based on Arithmetic Mean

International Journal of Digital Crime and Forensics ◽

10.4018/ijdcf.2017070103 ◽

2017 ◽

Vol 9 (3) ◽

pp. 28-37

Author(s):

Lintao Liu ◽

Yuliang Lu ◽

Xuehu Yan ◽

Song Wan

Keyword(s):

Visual Quality ◽

Recovery Process ◽

Arithmetic Mean ◽

Secret Image Sharing ◽

Binary Images ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme ◽

Grayscale Images

The current researches in secret sharing techniques have limitations of lossy recovery for binary images, complex computation for grayscale images, and “All-or-Nothing”. In this paper, we propose a novel progressive secret image sharing (PSS) scheme based on arithmetic mean. In the proposed scheme, the more shares are collected, the better recovered visual quality will be. Furthermore, it can realize lossless recovery with all the shares. It can be directly used to share grayscale images and can be easily extended to deal with binary and color images. In the recovery process, it only needs simple computing (arithmetic mean). Simulations show the advantages and effectiveness of the proposed scheme.

Download Full-text

Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

International Journal of Digital Crime and Forensics ◽

10.4018/ijdcf.2018040107 ◽

2018 ◽

Vol 10 (2) ◽

pp. 120-136 ◽

Cited By ~ 7

Author(s):

Wanmeng Ding ◽

Kesheng Liu ◽

Xuehu Yan ◽

Lintao Liu

Keyword(s):

Storage Capacity ◽

Image Data ◽

Secret Sharing Scheme ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme ◽

And Storage ◽

Secret Image Sharing Scheme

Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret image sharing, despite many previous researchers attempted to achieve lossless recovery, none of the proposed work can simultaneously satisfy an efficiency execution and at no cost of some storage capacity. This article proposes a secret sharing scheme with fully lossless recovery based on polynomial-based scheme and modular algebraic recovery. The major difference between the proposed method and polynomial-based scheme is that, instead of only using the first coefficient of sharing polynomial, this article uses the first two coefficients of sharing polynomial to embed the pixels as well as guarantee security. Both theoretical proof and experimental results are given to demonstrate the effectiveness of the proposed scheme.

Download Full-text

An Image Secret Sharing Method Based on Matrix Theory

Symmetry ◽

10.3390/sym10100530 ◽

2018 ◽

Vol 10 (10) ◽

pp. 530 ◽

Cited By ~ 8

Author(s):

Wanmeng Ding ◽

Kesheng Liu ◽

Xuehu Yan ◽

Huaixi Wang ◽

Lintao Liu ◽

...

Keyword(s):

Secret Sharing ◽

Matrix Theory ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme ◽

Image Secret Sharing ◽

Special Case ◽

Secret Image Sharing Scheme

Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, instead of the principle of Shamir’s polynomial-based SS scheme. In this paper, matrix theory is used to analyze Shamir’s polynomial-based scheme, and a general (k, n) threshold secret image sharing scheme based on matrix theory is proposed. The effectiveness of the proposed scheme is proved by theoretical and experimental results. Moreover, it has been proved that the Shamir’s polynomial-based SS scheme is a special case of our proposed scheme.

Download Full-text

Weighted Polynomial-Based Secret Image Sharing Scheme with Lossless Recovery

Security and Communication Networks ◽

10.1155/2021/5597592 ◽

2021 ◽

Vol 2021 ◽

pp. 1-11

Author(s):

Yongjie Wang ◽

Jia Chen ◽

Qinghong Gong ◽

Xuehu Yan ◽

Yuyuan Sun

Keyword(s):

Light Transmission ◽

Chinese Remainder Theorem ◽

Secret Image Sharing ◽

Visual Secret Sharing ◽

Theoretical Derivation ◽

Secret Image ◽

Image Sharing ◽

Lossless Recovery ◽

Sharing Scheme

In some particular scenes, the shadows need to be given different weights to represent the participants’ status or importance. And during the reconstruction, participants with different weights obtain various quality reconstructed images. However, the existing schemes based on visual secret sharing (VSS) and the Chinese remainder theorem (CRT) have some disadvantages. In this paper, we propose a weighted polynomial-based SIS scheme in the field of GF (257). We use k , k threshold polynomial-based secret image sharing (SIS) to generate k shares and assign them corresponding weights. Then, the remaining n − k shares are randomly filled with invalid value 0 or 255. When the threshold is satisfied, the number and weight of share can affect the reconstructed image’s quality. Our proposed scheme has the property of lossless recovery. And the average light transmission of shares in our scheme is identical. Experiments and theoretical analysis show that the proposed scheme is practical and feasible. Besides, the quality of the reconstructed image is consistent with the theoretical derivation.

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