Implementation K out of N visual cryptography using K out of K scheme

Hasnat, Abul; Barman, Dibyendu; Mandal, Satyendra Nath

doi:10.1109/iciiecs.2017.8275942

Cited by 3 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have developed the (k, n) Visual scheme using K out of K scheme [10]. In the proposed model a maximum of four shares will be generated and minimum of two shares are required to decrypt the original image .The proposed system provides acknowledgement to the sender after the receiver has decrypted the image.…”

Section: Proposed Systemmentioning

confidence: 99%

Secret Image Sharing using Visual Cryptography Shares with Acknowledgement

Sanaboina¹,

Odugu²,

Vanamadi³

2019

IJITEE

View full text Add to dashboard Cite

Visual Cryptography is an encryption technique in which the secret image is encoded and divided into n meaningless images called shares. The shares look like black and white dots embedded randomly in an image. These shares don't reveal any information about the original image. Every share was printed on transparent paper and decrypted through the superimposition of shares without any computer decryption algorithm. When all n shares were overlapped, the original picture would appear. A (k, n)-threshold visual cryptography is a technique in which n is the maximum number of shares that are to be generated and k is the minimum number of shares that are required to decrypt the original image. If the insufficient number of shares, which are less than the k value is given to the decryption function, the decryption function will generate the output, which doesn't reveal any clue to the original image. This paper presents how the Entropy, Mean Square Error (MSE), Peak Signal Noise Ratio (PSNR) values varies with respect to given same image of different sizes.Index Terms-shares, visual cryptography, visual secret sharing I.

show abstract

Section: Proposed Systemmentioning

confidence: 99%