A cheating prevention scheme for binary visual cryptography with homogeneous secret images

Tsai, Du-Cheng; Chen, Tzung‐Her; Horng, Gwoboa

doi:10.1016/j.patcog.2007.01.013

Cited by 82 publications

(27 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7] Tsai, Chen, Horng scheme, use Generic Algorithms (GA for short) to solve the cheating problem. The proposed scheme does against the cheating attack in VC.…”

Section: 1cheating Prevention Using Authentication Basedmentioning

confidence: 99%

Cheater identification in Visual secret sharing schemes using SHA Algorithm and Alpha channel.

Deepika¹,

Sreekumar²

2015

IJCATR

View full text Add to dashboard Cite

Secret sharing or secret splitting refers to methods for distributing a secret among a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number of shares are combined together. Individual shares are of no use on their own. Visual secret sharing (VSS) is an alternate form of secret sharing, where the visual information to be shared is distributed /encrypted in such a way that decryption done using Human Visual System. Visual secret is efficient since secret decoding only depends on the human vision system .There are several visual cryptographic schemes to encode the secret image into shares. In these schemes, normally a participant holds one share, and when the participants stack a sufficient number of shares, the secret image /the original image can be reconstructed through the human visual system. As we know where security is enforcing, there will be some provision to spoil the system. So in this case the dishonest participant, aka cheater, can provide a fake share to cheat other participants thereby he may reconstruct the original one and can use the same for any illegal purpose. In this paper, we propose a cheater identification method by adding an extra alpha channel with each share that contains the authentication information related to that particular share. Moreover the proposed scheme can be used with any visual cryptographic scheme to identify the cheaters.

show abstract

“…In [7] Tsai, Chen, Horng scheme, use Generic Algorithms (GA for short) to solve the cheating problem. The proposed scheme does against the cheating attack in VC.…”

Section: 1cheating Prevention Using Authentication Basedmentioning

confidence: 99%

Cheater identification in Visual secret sharing schemes using SHA Algorithm and Alpha channel.

Deepika¹,

Sreekumar²

2015

IJCATR

View full text Add to dashboard Cite

show abstract

“…Hu and W.G. Tzeng [34,35] have proposed a cheating method in Visual Cryptography schemes. In their cheating method, the cheater needs to know the exact distribution of black and white sub pixels of the shares of honest participants.…”

Section: Related Workmentioning

confidence: 99%

Error Filtering Schemes for Color Images in Visual Cryptography

F.R¹,

M.K²

2011

IJACSA

View full text Add to dashboard Cite

-The color visual cryptography methods are free from the limitations of randomness on color images. The two basic ideas used are error diffusion and pixel synchronization. Error diffusion is a simple method, in which the quantization error at each pixel level is filtered and fed as the input to the next pixel. In this way low frequency that is obtained between the input and output image is minimized which in turn give quality images. Degradation of colors are avoided with the help of pixel synchronization. The proposal of this work presents an efficient color image visual cryptic filtering scheme to improve the image quality on restored original image from visual cryptic shares. The proposed color image visual cryptic filtering scheme presents a deblurring effect on the non-uniform distribution of visual cryptic share pixels. After eliminating blurring effects on the pixels, Fourier transformation is applied to normalize the unevenly transformed share pixels on the original restored image. This in turn improves the quality of restored visual cryptographic image to its optimality. In addition the overlapping portions of the two or multiple visual cryptic shares are filtered out with homogeneity of pixel texture property on the restored original image. Experimentation are conducted with standard synthetic and real data set images, which shows better performance of proposed color image visual cryptic filtering scheme measured in terms of PSNR value (improved to 3 times) and share pixel error rate (reduced to nearly 11%) with existing grey visual cryptic filters. The results showed that the noise effects such as blurring on the restoration of original image are removed completely.

show abstract

“…MVCS can reveal different secret images by stacking shadows at different positions. VCSs with specific features, such as cheating prevention, solving misalignment problem, achieving the ideal contrast, sharing color image, were proposed [12]- [19]. Although VCS cannot recover the original image without distortion-less, the simplicity of VCS provides new applications in sharing secret images, e.g., visual authentication, steganography, and image encryption.…”

Section: Introductionmentioning

confidence: 99%

$k$ Out of $n$ Region Incrementing Scheme in Visual Cryptography

Yang

Shih

et al. 2012

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Abstract-Recently, Wang introduced a novel (2, n) region incrementing visual cryptographic scheme (RIVCS), which can gradually reconstruct secrets in a single image with multiple security levels. In RIVCS, the secret image is subdivided into multiple regions in such a way that any t shadow images, where 2 ≤ t ≤ n, can be used to reveal the (t − 1)th region. However, Wang's scheme suffers from the incorrect-color problem, which the colors of reconstructed images may be reversed (i.e., the black and white are reversed). If the color of text is also the secret information, the incorrect-color problem will compromise the secret. Additionally, Wang's scheme is only suitable for the 2-out-of-n case, i.e., (k, n)-RIVCS where k = 2. In this paper, we propose a general (k, n)-RIVCS, where k and n are any integers, that is able to reveal correct colors of all regions. This paper has made three main contributions: 1) our scheme is a general (k, n)-RIVCS, where k and n can be any integers; 2) the incorrectcolor problem is solved; and 3) our (k, n)-RIVCS is theoretically proven to satisfy the security and contrast conditions. Index Terms-Image secret sharing, secret sharing, visual cryptography, visual secret sharing.

show abstract

A cheating prevention scheme for binary visual cryptography with homogeneous secret images

Cited by 82 publications

References 14 publications

Cheater identification in Visual secret sharing schemes using SHA Algorithm and Alpha channel.

Cheater identification in Visual secret sharing schemes using SHA Algorithm and Alpha channel.

Error Filtering Schemes for Color Images in Visual Cryptography

$k$ Out of $n$ Region Incrementing Scheme in Visual Cryptography

Contact Info

Product

Resources

About