2006Journal of Anhui UniversityRequires access

A color visual cryptography scheme

Liusheng Huang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Secret sharing, Visual cryptography, Homomorphic secret sharing, Secure multi-party computation, Computer science, Scheme (mathematics), Image sharing, Image (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
A color visual cryptography scheme — Research Paper | ScholarLens