Invertible secret image sharing with steganography

Lin, Pei-Yu; Chan, Chi-Shiang

doi:10.1016/j.patrec.2010.01.019

Cited by 122 publications

(115 citation statements)

References 22 publications

Supporting

Mentioning

115

Contrasting

Order By: Relevance

“…Figure 8 shows pure capacity, defined by capacity minus extra storage. The proposed scheme performs almost as well as the Lin and Chan method [13]. The proposed scheme has nearly the same capacity as the other two methods but preserves better covered image quality with a higher PSNR.…”

Section: Discussionmentioning

confidence: 70%

“…This section compares the proposed scheme with two well-known invertible secret image sharing schemes 12,13 . The three schemes preserve the following properties (also shown in Table 4):…”

Section: Discussionmentioning

confidence: 99%

“…Lin et al 12 used pixels in secret and cover images to apply to the Shamir sharing function for pixel calculation of shared images. Lin and Chan 13 improved this technique 12 to increase the embedded capacity. Because an invertible secret image sharing scheme requires embedding abilities, the reversible watermarking method efficiently solves this problem; thus the proposed scheme used a reversible watermarking scheme to create an efficient invertible secret image sharing scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Share a Secret Image With Invertible and Lossy Charateristics

Chen

Liu

Lin

2016

ijecs

View full text Add to dashboard Cite

Conventional (t, n) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.

show abstract

Section: Discussionmentioning

confidence: 70%

“…This section compares the proposed scheme with two well-known invertible secret image sharing schemes 12,13 . The three schemes preserve the following properties (also shown in Table 4):…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Share a Secret Image With Invertible and Lossy Charateristics

Chen

Liu

Lin

2016

ijecs

View full text Add to dashboard Cite

show abstract

“…The essence of invertible image sharing approaches is that the revealed content of the secret image must be lossless and the distorted stego-images must be able to be reverted to the original cover image [3]. It achieves the transformation by mary notational system and share these transformation by (t,n) threshold scheme.…”

Section: Literature Reviewmentioning

confidence: 99%

Analysis of Secret Image Sharing using Shared Image

Dayanand¹,

Selvakumar²

2014

IJCA

View full text Add to dashboard Cite

A secret image sharing scheme with steganography lacks to provide the authentication, quality of stego-image and more cheating done by the dishonest participants. So, a secret image sharing using shared image technique is proposed to prevent the participants from the subsidiary stipulation of a false stego-image (an image containing the hidden secret image). A secret image is first processed into n shares which are then hidden in n user-selected suppression images. It is recommended to select these suppression images to contain well-known stuffing to increase the steganographic effect for the security protection.Additionally, an image watermarking technique is engaged to embed fragile watermark signals into the suppression images by the use of parity-bit checking, thus providing the ability of authenticating the reliability of each processed suppression image. During the secret image recovery process, each stegoimage carry by a participant is first verified for its reliability by checking the uniformity of the parity conditions found in the image pixels. This facilitates to avert the participant from subsidiary stipulation of a false stego-image.Some effective techniques for handling large images as well as for enhancing security protection are employed. As a result, the secret image sharing using shared image scheme offers a high secure and effective mechanism for secret image sharing that is not found in existing secret image sharing methods. High-class experimental results proving the authentication capability, secret hiding effectiveness and quality of the proposed approach are included.

show abstract

“…The small shadow size is a good property in practice. From then on, plenty of PSIS schemes based on Thien-and-Lin's scheme have been emerged to achieve more interesting performances, such as meaningful shares [7][8][9], two-in-one recovery [10,11] and shares with different priorities [12][13][14][15][16][17]. However, there exists a disadvantage in Thien-and-Lin's PSIS scheme that it cannot actually recover a lossless secret image, which is described in detail in Section 2.…”

Section: Introductionmentioning

confidence: 99%

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Zhou

Yan

et al. 2018

Symmetry

View full text Add to dashboard Cite

Thien-and-Lin's polynomial-based secret image sharing (PSIS) is utilized as the basic method to achieve PSISs with better performances, such as meaningful shares, two-in-one property and shares with different priorities. However, this (k, n) threshold PSIS cannot achieve lossless recovery for pixel values more than 250. Furthermore, current solutions to lossless recovery for PSIS have several natural drawbacks, such as large computational costs and random pixel expansion. In this paper, a lossless and efficient (k, n) threshold PSIS scheme with reduced shadow size is presented. For lossless recovery and efficiency, two adjacent pixels are specified as a secret value, the prime in the sharing polynomial is replaced with 65,537, and then the additional screening operation can ensure each shared value in the range [0, 65,535]. To reduce shadows size and improve security, only the first k − 1 coefficients are embedded with secret values and the last coefficient is assigned randomly. To prevent the leakage of secrets, generalized Arnold permutation with special key generating strategy is performed on the secret image prior to sharing process without key distribution. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme.

show abstract

Invertible secret image sharing with steganography

Cited by 122 publications

References 22 publications

Share a Secret Image With Invertible and Lossy Charateristics

Share a Secret Image With Invertible and Lossy Charateristics

Analysis of Secret Image Sharing using Shared Image

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Contact Info

Product

Resources

About