Progressive viewing and sharing of sensitive images

Fang, Wai-Chi; Lin, Jia‐Wei

doi:10.1134/s1054661806040080

Cited by 55 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the same time, some schemes related to the progressive VSS (PVSS) scheme have been proposed in recent years [18][19][20][21][22][23][24][25][26][27][28][29]. The term "progressive" indicates that the greater the number of shares stacked together, the clearer the restored image is.…”

Section: Introductionmentioning

confidence: 99%

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

2018

View full text Add to dashboard Cite

Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing scheme (SSS) can similarly encrypt and decrypt the original image by stacking at least k (≤ n) shares. If one stack is fewer than k shares, the secret image is unrecognizable. Another subject is progressive visual secret sharing, which means that when more shares are progressively stacked, the combined share becomes clearer. In this study, we constructed an advanced scheme for (k, n)-threshold SSS that can be encrypted in VC for any positive integers n ≥ k ≥ 2 through the method of combination, and the size of each share is the same as that of the original image. That is, no pixel expansion is required. Our scheme is novel, and the results from the theoretical analysis and simulation reveal that our scheme exhibits favorable contrast to that of other related schemes.

show abstract

Section: Introductionmentioning

confidence: 99%

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

2018

View full text Add to dashboard Cite

show abstract

“…In order to break this limitation, some researchers have been studied to solve how to sharing secret image progressively in visual secret sharing, which means that the more the participants work together, the higher quality of secret image they can retrieve. Fang and Lin proposed a progressively secret image sharing scheme for binary images [13]. In this scheme, the participants are weighted, which means, the important participant could have more than one shadows while other ordinary participant could have only one shadow each.…”

Section: Introductionmentioning

confidence: 99%

Sharing a Large Secret Image Using Meaningful Shadows Based on VQ and Inpainting

2015

KSII TIIS

View full text Add to dashboard Cite

This paper proposes a novel progressive secret image-hiding scheme based on the inpainting technique, the vector quantization technique (VQ) and the exploiting modification direction (EMD) technique. The proposed scheme first divides the secret image into non-overlapping blocks and categorizes the blocks into two groups: complex and smooth. The blocks in the complex group are compressed by VQ with PCA sorted codebook to obtain the VQ index table. Instead of embedding the original secret image, the proposed method progressively embeds the VQ index table into the cover images by using the EMD technique. After the receiver recovers the complex parts of the secret image by decoding the VQ index table from the shadow images, the smooth parts can be reconstructed by using the inpainting technique based on the content of the complex parts. The experimental results demonstrate that the proposed scheme not only has the advantage of progressive data hiding, which involves more shadow images joining to recover the secret image so as to produce a higher quality steganography image, but also can achieve high hiding capacity with acceptable recovered image quality.

show abstract

“…Their scheme can encode two or four secrets into two rectangular shares and up to eight secrets into two square shares. Some literatures [10][11][12][13][14][15][16] also have paid attention to research on the access structure in visual secret sharing. In 2009, Wang [10] proposed a region incrementing visual secret sharing scheme in which additional levels of secrets can be recovered when more shares are obtained in the decoding process.…”

Section: Introductionmentioning

confidence: 99%

Multi-Threshold Visual Secret Sharing

Guo¹,

Chang²,

Qin³

2012

AISS

View full text Add to dashboard Cite

Visual cryptography (VC) has been developed extensively based on its practicability. These schemes can encode a black-and-white secret image into several shadow images, and, by stacking a certain number of shadow images, can retrieve the secret image through the human visual system. In this paper, we employ Hsu et al.'s ideal multi-threshold secret sharing scheme based on monotone span programs (MSP) to propose a multi-threshold visual secret sharing scheme. In our scheme, there are multiple secret images to be shared among a group of shadow images, and we can define the corresponding multiple access structures for different secret images. Accordingly, different qualified subsets of the group of shadow images can recover the different secret images by stacking them. The experimental results demonstrated that the proposed scheme is feasible and practical.

show abstract

Progressive viewing and sharing of sensitive images

Cited by 55 publications

References 8 publications

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

Sharing a Large Secret Image Using Meaningful Shadows Based on VQ and Inpainting

Multi-Threshold Visual Secret Sharing

Contact Info

Product

Resources

About