Distributing Confidentiality to a Visual Secret Sharing Scheme
Neethu T. Sunil1, V. Tharmalingam2
1Neethu T. Sunil, Computer Science and Engineering, Annai Mathammal Sheela Engineering College, Namakkal District, Tamil Nadu, India.
2V. Tharmalingam, Computer Science and Engineering, Annai Mathammal Sheela Engineering College, Namakkal District, Tamil Nadu, India.
Manuscript received on March 03, 2013. | Revised Manuscript received on April 13, 2013. | Manuscript published on April 30, 2013. | PP: 132-135 | Volume-2, Issue-4, April 2013. | Retrieval Number: D1333042413/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A Visual Secret Sharing (VSS) scheme is one realization of secret sharing schemes without using computation which distinguishes VSS from ordinary cryptography. In a typical VSS scheme (normally called a (k, n) –threshold VSS scheme), a dealer encodes a secret image in to ‘n’ shares each of which reveals no information regarding the secret image. In this system ,the secret image can be reproduced only by stacking n number of shares in the correct order. The reproduced images will be clearer (larger contrast) and with small pixel expansion compared to Unconditional security VSS scheme. This security notion is effective when attackers cannot use computers since it may take much time to analyze combinations of sub pixels exhaustively.
Keywords: Visual secret sharing, Weaker security sharing, halftone technique, visual cryptography.