A color visual cryptography scheme
Liusheng Huang
Abstract
Liusheng Huang
Abstract
This article proposes a new color visual secret sharing scheme.The scheme allows encoding an image into n shared images distributed to n players,so that only qualified subsets of these players can recover the secret image,but any unqualified subsets of them gain no information about the secret image.Where each shared image has the same size as the secret one,and the recovered image is as same as the secret one such that there is no loss of the secret.It is secure,efficient and simple to implement the scheme,which fits to share any color images for general access structure.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article proposes a new color visual secret sharing scheme.The scheme allows encoding an image into n shared images distributed to n players,so that only qualified subsets of these players can recover the secret image,but any unqualified subsets of them gain no information about the secret image.Where each shared image has the same size as the secret one,and the recovered image is as same as the secret one such that there is no loss of the secret.It is secure,efficient and simple to implement the scheme,which fits to share any color images for general access structure.
Key concepts: Secret sharing, Visual cryptography, Homomorphic secret sharing, Secure multi-party computation, Computer science, Scheme (mathematics), Image sharing, Image (mathematics)