Sharing multiple secrets in visual cryptography

Shyu, Shyong Jian; Huang, Shih‐Yu; Lee, Yeuan-Kuen; Wang, Ran-Zan; Chen, Kun

doi:10.1016/j.patcog.2007.03.012

Cited by 196 publications

(85 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By manipulating the three color values, the color pixels in the secret image can be represented. However, similar to what happens in [8,9,11], the shares are meaningless. Most of the Color Visual Cryptographic techniques do not give the original image back.…”

Section: Introductionsupporting

confidence: 60%

“…The content of the secret image may text or simple black-andwhite designs. Now researchers concentrate on developing new cryptography schemes that can process secret color images [7][8][9][10] that are more complex. Verheul et al proposed a (k, n)-threshold color visual secret sharing scheme [11] based on pixel expansion for p color images.…”

Section: Introductionmentioning

confidence: 99%

“…In 2007, Shyu proposed an efficient c-color (k, n)-threshold visual secret sharing scheme [9] and has further improved the pixel expansion to maintain good visual quality of the revealed secret image. However, in spite of all the advancements both schemes have made, the shares produced by [10] and [11] are meaningless.…”

Section: Introductionmentioning

confidence: 99%

“…The shares generated in these schemes [7][8][9][10][11] are meaningless and look like random dots. These meaningless images may make easy targets for internet invaders to peep in.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

MSKS for Data Hiding and Retrieval using Visual Cryptography

ShanthiRani¹,

M.²,

Mary³

et al. 2014

IJCA

View full text Add to dashboard Cite

Secret message in the form of image can be concealed into two or more images in Visual Cryptography (VC) schemes. The secret image can be recovered simply by stacking the shares together without any complex computation involved. The shares do not reveal any information about the secret image if they are viewed separately. In this paper, a color visual cryptography scheme using a combination of Meaningful Shares (MS) and a Key Share (KS) is proposed. These MS will not provoke the attention of hackers. The proposed scheme makes use of the XOR operation to create KS from the MS and secret image. The secret image can be decrypted by stacking the n-1 meaningful shares and key shares together by performing XOR operation. Experimental results show that the new scheme is perfectly applicable and achieves a high two level security.

show abstract

Section: Introductionsupporting

confidence: 60%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…The shares generated in these schemes [7][8][9][10][11] are meaningless and look like random dots. These meaningless images may make easy targets for internet invaders to peep in.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

MSKS for Data Hiding and Retrieval using Visual Cryptography

ShanthiRani¹,

M.²,

Mary³

et al. 2014

IJCA

View full text Add to dashboard Cite

show abstract

“…To overcome the angle limitation of Wu and Chen's scheme [8], Hsu et al [9] proposed a scheme to hide two secret images in two rectangular shares with arbitrary rotating angles. S J Shyu et al [10] advise multiple secrets sharing scheme encodes a set of n≥2 secrets into two circular shares. The n secrets can be retrieved one by one by stacking the first share and the rotated second share with n different rotation angles.…”

Section: Introductionmentioning

confidence: 99%

Binary Image Visual Cryptography

Ismaiel¹,

Khether²

2017

IJCA

View full text Add to dashboard Cite

Modern computer networks make it possible to distribute documents quickly and economically. This is because of the decreasing cost of the equipment needed to copy, print, process the information. The widespread adoption of electronic distribution of material is accompanied with more emphasis on data security. One of the modern data security methods is Visual Cryptography. Visual Cryptography(VC) is the technique that is used for securing data specially image-based secrets such as credit card information, personal health information, military maps and personally identifiable information and commercial identification data.Visual Cryptography allow us to share secret effectively and efficiently, the secret image can be distributed in to two or more shares, when shares are superimposed exactly together the original image would be discovered with human visual system(HVS) without out aid of computer or without performing complicated computations.

show abstract

Polarization‐Assisted Visual Secret Sharing Encryption in Metasurface Hologram

Zhang

et al. 2021

Advanced Photonics Research

View full text Add to dashboard Cite

offer high degree of holographic data capacity and state-of-theart visual image encryption. However, in all these works, each valid information corresponds to one individual decryption key in each channel, so that the difficulty of information deciphering can be improved only by increasing the diversity of the electromagnetic channels. In addition, the information leakage of any one of the channels may cause the eavesdropper to decipher all the relevant information directly.Based on the Moire effect from random dots, human visual system (HVS) can be used to identify the local correlation from random noise grids and combine them from different regions of the visual field. [25] This characteristic of HVS was later extended for images encryption by encoding the secret information into several noiselike random grids. [26] As these random grids are stacked and viewed together, the secret information can be emerged from the random background noise. Visual secret sharing (VSS), also named as visual cryptography, [27][28][29][30][31] as the derivative of this mechanism, describes an effective encryption strategy where the secret information can be encoded to n mutually-unrelated shared keys (SKs) and distributed to n participants so that any k ðk ≤ nÞ of n combinations of the authorized participants can recover the secret information, while any less than k participants reveal nothing of the secret. Obviously, the VSS established a well-recognized simple and secure method for information protection, which has been adopted in

show abstract

Sharing multiple secrets in visual cryptography

Cited by 196 publications

References 6 publications

MSKS for Data Hiding and Retrieval using Visual Cryptography

MSKS for Data Hiding and Retrieval using Visual Cryptography

Binary Image Visual Cryptography

Polarization‐Assisted Visual Secret Sharing Encryption in Metasurface Hologram

Contact Info

Product

Resources

About