XOR-based unexpanded meaningful visual secret sharing scheme
by Suresh Prasad Kannojia; Jasvant Kumar
International Journal of Security and Networks (IJSN), Vol. 14, No. 1, 2019

Abstract: Visual cryptography is a technique to conceal the secret information into n shares, distributed to n participants. When any k ≤ n, 2 ≤ k ≤ n, shares are printed on transparencies and stacked together, information about secret image can be revealed directly by the human visual system with poor visual quality. It is an issue for the researchers, to improve the quality of shares and reconstructed image. This paper proposes n-out-of-n, n = 2 × i, i = 1, 2, 3 XOR-based unexpanded meaningful visual secret sharing scheme for binary or halftone secret image. When all the shares are 'XOR'ed, it reveal secret image without any loss. Feasibility of the proposed scheme is checked by extensive experimental results on a binary image. Experimental results and comparison with related works show that proposed scheme performs better than the state-of-the-art approaches. It is analysed on the basis of some quality metrics to evaluate the performance.

Online publication date: Tue, 09-Apr-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com