Distortion-free secret image sharing mechanism using modulus operator

Lin, Pei-Yu; Lee, Jung-San; Chang, Chin‐Chen

doi:10.1016/j.patcog.2008.09.014

Cited by 78 publications

(48 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate our scheme's performance, this subsection compares our scheme with various approaches [11,13,14,20,22,24]. Since the PSNR value of Yang and Tsai [14] is better than those of Zeng et al [12] and Yang and Hu [15] when the payload approaches 1 bpp, the performance comparison does not include both methods.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Yang

2012

Advances in Multimedia

View full text Add to dashboard Cite

This paper proposes a novel form of reversible data hiding using two marked images by employing the adaptive coefficient-shifting (ACS) algorithm. The proposed ACS algorithm consists of three parts: the minimum-preserved scheme, the minimum-preserved with squeezing scheme, and the base-value embedding scheme. More specifically, each input block of a host image can be encoded to two stego-blocks according to three predetermined rules by the above three schemes. Simulations validate that the proposed method not only completely recovers the host medium but also losslessly extracts the hidden message. The proposed method can handle various kinds of images without any occurrence of overflow/underflow. Moreover, the payload and peak signal-tonoise ratio (PSNR) performance of the proposed method is superior to that of the conventional invertible data hiding schemes. Furthermore, the number of shadows required by the proposed method is less than that required by the approaches which are based upon secret image sharing with reversible steganography.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Moreover, to fully recover the host image and losslessly extract the hidden message, researchers [24,25] presented reversible secret image sharing with steganography. However, a (t, n) threshold of secret image sharing with steganography often requires t ≤ n and n ≥ 3.…”

Section: Input Blockmentioning

confidence: 99%

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Yang

2012

Advances in Multimedia

View full text Add to dashboard Cite

show abstract

“…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 and Tsai 11 presented steganography and parity check techniques to share and authenticate images. 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.…”

Section: Introductionmentioning

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 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

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

A novel weighted threshold secret image sharing scheme^†

Guo

2015

Security Comm. Networks

View full text Add to dashboard Cite

In traditional secret image sharing schemes, the participants have the same status, and shadow images are of approximately equal importance, which cannot satisfy some special requirements in real situations. In this paper, we considered the problem of secret image sharing with the weighted threshold access structure, which means different participants can have different status and significance. With this approach, each shadow image has one weight, and the secret image can be reconstructed losslessly if, and only if, the sum of all of the shadow images' weights is no less than the given weight threshold. In our scheme, we constructed the weighted threshold access structure of shadow images using the weighted threshold secret sharing scheme. Then, we used the quantization operation to embed the secret image's information into a host image to generate shadow images with different weights. In the retrieving procedure, a set of shadow images that satisfied the weighted threshold was utilized to restore the distortion-free secret image. Our experimental results confirmed that the proposed scheme was feasible, and both the visual quality of the shadow images and the embedding capacity of the host images were satisfactory.

show abstract

Distortion-free secret image sharing mechanism using modulus operator

Cited by 78 publications

References 13 publications

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Share a Secret Image With Invertible and Lossy Charateristics

A novel weighted threshold secret image sharing scheme^†

Contact Info

Product

Resources

About

Distortion-free secret image sharing mechanism using modulus operator

Cited by 78 publications

References 13 publications

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Reversible Data Hiding Using Two Marked Images Based on Adaptive Coefficient-Shifting Algorithm

Share a Secret Image With Invertible and Lossy Charateristics

A novel weighted threshold secret image sharing scheme†

Contact Info

Product

Resources

About

A novel weighted threshold secret image sharing scheme^†