2006Jisuanji yingyong yanjiuRequires access

A New Color Visual Secret Sharing Scheme

Runhua Shi

Open publisher page 0 citations

Abstract

Proposes a color visual secret sharing scheme based on solving the linear equations.The scheme allows to encode an image into n shared images so that any k or more shares can recover the secret image,but any k-1 or fewer of them gain no information about the original image.In addition,each shared image has the same size that the original one,and the recovered image is exactly the same than the secret image such that ther is no loss of the secret.Thus,it is an ideal and perfect(k,n) threshold scheme to share bw,gray-level or color images in a secret way.

About this research paper

What this paper is about

Proposes a color visual secret sharing scheme based on solving the linear equations.The scheme allows to encode an image into n shared images so that any k or more shares can recover the secret image,but any k-1 or fewer of them gain no information about the original image.In addition,each shared image has the same size that the original one,and the recovered image is exactly the same than the secret image such that ther is no loss of the secret.Thus,it is an ideal and perfect(k,n) threshold scheme to share bw,gray-level or color images in a secret way.

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

Proposes a color visual secret sharing scheme based on solving the linear equations.The scheme allows to encode an image into n shared images so that any k or more shares can recover the secret image,but any k-1 or fewer of them gain no information about the original image.In addition,each shared image has the same size that the original one,and the recovered image is exactly the same than the secret image such that ther is no loss of the secret.Thus,it is an ideal and perfect(k,n) threshold scheme to share bw,gray-level or color images in a secret way.

Key concepts: Secret sharing, Computer science, Image sharing, Shamir's Secret Sharing, Homomorphic secret sharing, Image (mathematics), Scheme (mathematics), Secure multi-party computation

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Color Visual Secret Sharing Scheme — Research Paper | ScholarLens