A Patching Algorithm for Extended Visual CryptographyReportar como inadecuado




A Patching Algorithm for Extended Visual Cryptography - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Generally, shares of Visual Secret Sharing scheme VSS scheme consist of a lot of random pixels so that they looked meaningless. Hence, it is difficult for the participants to manage and identify these shares. For addressing the problem, Extended Visual Cryptography Scheme EVCS adds meaningful camouflage patterns to the shares. In previous conventional VSS schemes, the encryption manners cannot be applied to EVCS directly. Namely, the researchers have to reconstruct EVCS for each scheme. Additionally, the manners should introduce more pixel expansions, which is unpractical to store and deliver the share images. Moreover, the finding of the minimum expansion on EVCS is a NP-hard problem. Therefore, the paper proposes a novel EVCS algorithm for binary secret images; for a giving access structure, our algorithm can construct an EVCS without pixel expansion. On the first stage, the algorithm obtains a set of shares without pixel expansion by the existing constructions for traditional VSS scheme. On the second stage, the proposed algorithm adds meaningful camouflage patterns to the shares without pixel expansion. The experimental result shows that not only the EVCS construction manner doesn’t introduce pixel expansion but also the quality of recovered image is very close to the quality of VSS without camouflage patterns.

KEYWORDS

visual secret sharing; pixel expansion; extended visual cryptography scheme

Cite this paper







Autor: Kai-Hui Lee, Pei-Ling Chiu, Chien-Chu Tsang, Pei-Shan Yeh

Fuente: http://www.scirp.org/



DESCARGAR PDF




Documentos relacionados