Efficient visual secret sharing scheme for color images

Shyu, Shyong Jian

doi:10.1016/j.patcog.2005.06.010

Cited by 126 publications

(58 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2006 the Zhi Zhou, Gonzalo, R.Arce and Giovanni Dicrescenzo [29][30][31][32][33] have proposed halftone visual cryptography which produce good quality and meaningful halftone shares, the generated halftone shares contain the visual information. In halftone visual cryptography a secret binary pixel "P" is encoded into an array of Q1 x Q2 ("m" in basic model) sub pixels, referred to as halftone cell in each of the "n" shares.…”

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

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

show abstract

“…the lines and dots in the patterns should be a block of pixels rather than a single pixel; Because of the alignment problem [9,10], pixels within the shares cannot be too small. Many studies tried to increase the secret volume of VC shares, such as sharing a plural number of secret images in one VCS [11,12], using rotated shares [13] or using color VC scheme [14][15][16]. However, these methods could not increase the capability too much if the ratio R = t m is taken into consideration, where t is the number of secret bits that are shared by every m sub-pixels.…”

Section: Introductionmentioning

confidence: 99%

ESSVCS: An Enriched Secret Sharing Visual Cryptography

Liu

Yan

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Visual Cryptography (VC) is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography with that of raster graphics. A binary image can be divided into shares that are able to be stacked together so as to approximately recover the original image. VC is a unique technique in the sense that the encrypted message can be decrypted directly by the Human Visual System (HVS). The distinguishing characteristic of VC is the ability of secret restoration without the use of computation. However because of restrictions of the HVS, pixel expansion and alignment problems, a VC scheme perhaps can only be applied to share a small size of secret image. In this paper, we propose a general method to let the VC shares carry more secrets, the technique is to use cypher output of private-key systems as the input random numbers of VC scheme, meanwhile the encryption key could be shared, the shared keys could be associated with the VC shares. After this operation, VC scheme and secret sharing scheme are merged with the private-key system. Under this design, we implement a (k, t, n)-VC scheme. Compared to those existing schemes, our approach could greatly enhance the ability of current VC schemes and could cope with pretty rich secrets.

show abstract

“…Visual cryptography schemes are also presented for color and grey level images. Visual cryptography for color images was first introduced by Hou in which he proposed three algorithms in which the first one of them contains three color shares and a black mask and the image resulted from decryption has a brightness of 50 percent while two other algorithms contain a brightness of 25 percent and two color shares [3][4][5][6]. In accordance with the foregoing security analysis, the security breach of the first algorithm is Manuscript received May 15, 2012; revised June 12, 2012 apparent.…”

Section: Introductionmentioning

confidence: 99%

“…2" and also the image resulted from stacking all shares. It is noteworthy that in the proposed visual cryptographic scheme, size of the image is enlarged with a factor of four and the results of encryption are shown with a factor of 4 1 . …”

Section: Introductionmentioning

confidence: 99%

An Improved Visual Cryptography Scheme Using Scrambling Pixels in Color Images

Dastanian¹

2012

IJIEE

View full text Add to dashboard Cite

Abstract-Color visual cryptography scheme is useful in systems that need access control management and authentication like digital signature schemes used in banks that demand multi partner shares. In one of the basic visual cryptography schemes for color images, proposed by Hou et. al. it is claimed that an adversary cannot attain any knowledge about the secret image without the black mask. While by security analysis of this scheme we observe that having three color shares and stacking them, an adversary is able to distinguish color boundaries of the image and by considering the available colors of the image he can reach to the main image with a non negligible probability. In this paper, we utilize Arnold's cat matrix to enhance the security of this scheme by means of pixel scrambling. In the proposed scheme, we mislead the adversary who stacks three color shares of the image to reconstruct the main image. Therefore, without a meaningful loss in the speed of encryption procedure, the security of Hou scheme is increased. The simulation results justify our claim. Index Terms-Visual cryptography, halftone method, pixel scrambling I. INTRODUCTIONVisual cryptography scheme was first introduced in 1994 by Shamir and Noar [1]. In this scheme the secret image is divided into some shares in such a way that no information can be inferred about the secret image only by one image. But when shares are stacked, the secret image will be unfold such that the human eye can easily distinguish it. It is noteworthy that using this cryptographic method expands the secret image size by the factor of four, because in this method the secret pixel as can be seen in " Fig. 1", is substituted by a four-pixel block. As an example if a pixel in the secret image is black, we can consider one out of six black pixels in " Fig. 1". As an example if the fifth row is selected, two blocks shown in the fifth row will be selected for share #1 and share #2. So when these two blocks of two shares are overlaid, the black pixel will be resulted [2]. Visual cryptography schemes are also presented for color and grey level images. Visual cryptography for color images was first introduced by Hou in which he proposed three algorithms in which the first one of them contains three color shares and a black mask and the image resulted from decryption has a brightness of 50 percent while two other algorithms contain a brightness of 25 percent and two color shares [3][4][5][6]. In accordance with the foregoing security analysis, the security breach of the first algorithm is Manuscript received May 15, 2012; revised June 12, 2012 apparent. In which only two color shares out of the total three can provide adversary with some information about the secret image. In this regard, the boundaries of the image show up and the adversary can color the resulting image depending on the available colors of the image. In this paper in order to enhance the security of the predecessor scheme proposed by Hou, using the Arnold's cat matrix, we scramble the pixels of the image in su...

show abstract

Efficient visual secret sharing scheme for color images

Cited by 126 publications

References 14 publications

Error Filtering Schemes for Color Images in Visual Cryptography

Error Filtering Schemes for Color Images in Visual Cryptography

ESSVCS: An Enriched Secret Sharing Visual Cryptography

An Improved Visual Cryptography Scheme Using Scrambling Pixels in Color Images

Contact Info

Product

Resources

About