Scalable secret image sharing

Wang, Ran-Zan; Shyu, Shyong-Jian

doi:10.1016/j.image.2006.12.012

Cited by 104 publications

(80 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After the preprocessing phase, each block is assigned a prime number, which is utilized to compute coefficients f 0 and f 1 for the polynomial function as follows: (10) where  …”

Section: The Sharing Phasementioning

confidence: 99%

“…If L = 1, the prime number is q 3 ; otherwise, the prime number is determined using the LSBs of two shadow pixels, such as (00), (01), or (10), to obtain prime numbers of q 0 , q 1 , or q 2 . This similarity allows users to recognize each shadow image without any computations, thereby providing a user-friendly interface for identifying shadow images with the naked eye.…”

Section: The Recovery Phasementioning

confidence: 99%

“…However, important information is omitted from this view. Figure 4(f) shows the image reconstructed using the proposed method that has higher quality than images reconstructed with other methods [5,6,10] (Table 1). The quality of the reconstructed image is analyzed using the peak signal-to-noise ratio (PSNR).…”

Section: The Recovery Phasementioning

confidence: 99%

See 2 more Smart Citations

User-Friendly Sharing System using Polynomials with Different Primes in Two Images

Vo¹

2014

IJCA

View full text Add to dashboard Cite

Yang et al. recently developed a user-friendly image-sharing scheme that shares images using many polynomials with different primes. Yang et al. modified the least significant bit (LSB) of original pixels to identify the prime number for sharing. However, the reconstructed image retains some noise. The scheme proposed in this work uses polynomials with different primes to generate pixel shadows without adjusting the LSBs of original pixels, such that the recovery process can reconstruct a high-quality original image using the Lagrange interpolation function.

show abstract

“…After the preprocessing phase, each block is assigned a prime number, which is utilized to compute coefficients f 0 and f 1 for the polynomial function as follows: (10) where  …”

Section: The Sharing Phasementioning

confidence: 99%

Section: The Recovery Phasementioning

confidence: 99%

See 1 more Smart Citation

User-Friendly Sharing System using Polynomials with Different Primes in Two Images

Vo¹

2014

IJCA

View full text Add to dashboard Cite

show abstract

“…Blakley and Shamir [1,2] first conceptualized the idea of a (t, n) threshold secret sharing scheme, in which at least a minimum number t out of n participants are required in order to recover the secret. This scheme has been extended by various researchers [3][4][5][6][7][8][9][10][11][12][13][14][15][16] and successfully applied to activities such as protection of PDF files [12], visual cryptography [13,14], and network communication [15]. For digital media, many schemes for ensuring image sharing security have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Progressive sharing of multiple images with sensitivity-controlled decoding

Chang

Lee

Yeh

et al. 2015

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

Secure sharing of digital images is becoming an important issue. Consequently, many schemes for ensuring image sharing security have been proposed. However, existing approaches focus on the sharing of a single image, rather than multiple images. We propose three kinds of sharing methods that progressively reveal n given secret images according to the sensitivity level of each image. Method 1 divides each secret image into n parts and then combines and hides the parts of the images to get n steganographic (stego) JPEG codes of equal importance. Method 2 is similar; however, it allocates different stego JPEG codes of different 'weights' to indicate their strength. Method 3 first applies traditional threshold-sharing to the n secret images, then progressively shares k keys, and finally combines the two sharing results to get n stego JPEG codes. In the recovery phase, various parameters are compared to a pre-specified low/middle/high (L/M/H) threshold and, according to the respective method, determine whether or not secret images are reconstructed and the quality of the images reconstructed. The results of experiments conducted verify the efficacy of our methods.

show abstract

“…The essential idea is to use a polynomial function of order k -1 to construct n image shares, in which the size of each share image is only 1/k times of the original image, but the computational complexity is the same as in Samir's scheme. This work attracted many researchers to propose different techniques which are given in references [4][5][6][7]. But in [3] T h i e n and L i n proposed a method in which the pixels having a value greater that 251, are truncated into 250.…”

Section: Introductionmentioning

confidence: 99%