Friendly progressive visual secret sharing

Fang, Wen‐Pinn

doi:10.1016/j.patcog.2007.09.004

Cited by 109 publications

(66 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, many researchers proposed other functional secret image sharing schemes, such as reduced load for sharing multiple secret images 2,3 , cheater identification 4 , progressive sharing 5,6 , weighted sharing 7 , visual cryptography and secret image sharing 8 , authentication strength 9 , and scalable sharing 10 .…”

Section: Introductionmentioning

confidence: 99%

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

confidence: 99%

Share a Secret Image With Invertible and Lossy Charateristics

Chen

Liu

Lin

2016

ijecs

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%

“…Lin and Tsai proposed image sharing schemes with authentication capabilities [9], or with reduction of share size [10]. Further, some approaches are devoted to progressively decoding secrets [3][4][5][6][7].…”

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

“…Therefore, in some situations where a computer is not available to the decipherer, a vision-based secret sharing method provides an apt solution. As regards visual secret sharing research, encryption methods may differ between pixel expansion skill [4,5,6,7,8,9,10,11] and pixel non-expansion skill [12,13,14,15,16]. The majority of the sharing images generated by the above two encryption skills is chaotic, but provides meaningful images [4,9,10].…”

Section: Introductionmentioning

confidence: 99%

A Secure Visual Secret Checking of Meaningful Sharing Images

Chen¹,

Chen²,

Chen³

et al. 2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Visual secret checking refers to the superimposition of one key image and another public sharing image without auxiliary automated computation, in order to recognize the specified secret via human inspection. This paper achieves the goals of: guaranteeing that the related contents of a secret are not revealed after any public sharing image superimposition, confirming the accuracy of any public sharing image, and providing for the ease of management of various types of sharing images. When a user is outside of a computer environment, he/she can utilize the proposed method to discern the contents of the secret independently. Furthermore, the key image and all the sharing images have the same meaning, visible upon inspection, which allows for effective data management and classification. Through an exposition of the relevant theory, as well as experimentation, this paper provides evidence for the above claims.

show abstract

Friendly progressive visual secret sharing

Cited by 109 publications

References 13 publications

Share a Secret Image With Invertible and Lossy Charateristics

Share a Secret Image With Invertible and Lossy Charateristics

Progressive sharing of multiple images with sensitivity-controlled decoding

A Secure Visual Secret Checking of Meaningful Sharing Images

Contact Info

Product

Resources

About